./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-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:51:47,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:51:47,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:51:47,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:51:47,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:51:47,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:51:47,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:51:47,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:51:47,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:51:47,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:51:47,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:51:47,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:51:47,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:51:47,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:51:47,843 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:51:47,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:51:47,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:51:47,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:51:47,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:51:47,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:51:47,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:51:47,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:51:47,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:51:47,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:51:47,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:51:47,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:51:47,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:51:47,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:51:47,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:51:47,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:51:47,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:51:47,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:51:47,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:51:47,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:51:47,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:51:47,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:51:47,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:51:47,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:51:47,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:51:47,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:51:47,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:51:47,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:51:47,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-14 13:51:48,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:51:48,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:51:48,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:51:48,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:51:48,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:51:48,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:51:49,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:51:49,928 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:51:49,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:51:49,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8253f1751/b8b18678764d44ef91236a0fc9323e8b/FLAG577c1fe4a [2024-10-14 13:51:50,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8253f1751/b8b18678764d44ef91236a0fc9323e8b [2024-10-14 13:51:50,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:51:50,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:51:50,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:51:50,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:51:50,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:51:50,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d28dadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50, skipping insertion in model container [2024-10-14 13:51:50,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:51:50,501 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-97.i[916,929] [2024-10-14 13:51:50,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:51:50,601 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:51:50,613 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-97.i[916,929] [2024-10-14 13:51:50,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:51:50,690 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:51:50,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50 WrapperNode [2024-10-14 13:51:50,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:51:50,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:51:50,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:51:50,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:51:50,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,761 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-10-14 13:51:50,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:51:50,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:51:50,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:51:50,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:51:50,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,836 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-14 13:51:50,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:51:50,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:51:50,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:51:50,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:51:50,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (1/1) ... [2024-10-14 13:51:50,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:51:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:51:50,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:51:50,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:51:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:51:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:51:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:51:51,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:51:51,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-14 13:51:51,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:51:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 13:51:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-14 13:51:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-14 13:51:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-14 13:51:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-14 13:51:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-14 13:51:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:51:51,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:51:51,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-14 13:51:51,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-14 13:51:51,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-14 13:51:51,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-14 13:51:51,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-14 13:51:51,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:51:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-14 13:51:51,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:51:51,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-14 13:51:51,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-14 13:51:51,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-14 13:51:51,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-14 13:51:51,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-14 13:51:51,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-14 13:51:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-14 13:51:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-14 13:51:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-14 13:51:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:51:51,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:51:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:51:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:51:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:51:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:51:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:51:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:51:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:51:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 13:51:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 13:51:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 13:51:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:51:51,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:51:51,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:51:51,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:51:51,919 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-14 13:51:51,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:51:51,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:51:51,965 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:51:51,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:51:51 BoogieIcfgContainer [2024-10-14 13:51:51,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:51:51,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:51:51,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:51:51,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:51:51,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:51:50" (1/3) ... [2024-10-14 13:51:51,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934a0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:51:51, skipping insertion in model container [2024-10-14 13:51:51,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:51:50" (2/3) ... [2024-10-14 13:51:51,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934a0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:51:51, skipping insertion in model container [2024-10-14 13:51:51,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:51:51" (3/3) ... [2024-10-14 13:51:51,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:51:51,999 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:51:51,999 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:51:52,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:51:52,083 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;@5b5ca821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:51:52,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:51:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:51:52,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:52,105 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:52,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -872643146, now seen corresponding path program 1 times [2024-10-14 13:51:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523853921] [2024-10-14 13:51:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523853921] [2024-10-14 13:51:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523853921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:52,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:51:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410676549] [2024-10-14 13:51:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:52,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:51:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:51:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:51:52,686 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:51:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:52,739 INFO L93 Difference]: Finished difference Result 199 states and 315 transitions. [2024-10-14 13:51:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:51:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-14 13:51:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:52,752 INFO L225 Difference]: With dead ends: 199 [2024-10-14 13:51:52,753 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 13:51:52,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-14 13:51:52,760 INFO L432 NwaCegarLoop]: 141 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, 141 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-14 13:51:52,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:51:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 13:51:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 13:51:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-10-14 13:51:52,806 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 129 [2024-10-14 13:51:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-10-14 13:51:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:51:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-10-14 13:51:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:51:52,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:52,812 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:52,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:51:52,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:52,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:52,813 INFO L85 PathProgramCache]: Analyzing trace with hash -716066796, now seen corresponding path program 1 times [2024-10-14 13:51:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322646048] [2024-10-14 13:51:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322646048] [2024-10-14 13:51:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322646048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:51:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378738139] [2024-10-14 13:51:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:51:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:51:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:51:53,468 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:53,533 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-10-14 13:51:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:51:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-14 13:51:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:53,540 INFO L225 Difference]: With dead ends: 199 [2024-10-14 13:51:53,540 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 13:51:53,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-14 13:51:53,544 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 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-14 13:51:53,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:51:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 13:51:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 13:51:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-10-14 13:51:53,560 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 129 [2024-10-14 13:51:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-10-14 13:51:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-10-14 13:51:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:53,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:53,564 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:51:53,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:53,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 595986690, now seen corresponding path program 1 times [2024-10-14 13:51:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288644521] [2024-10-14 13:51:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288644521] [2024-10-14 13:51:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288644521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:51:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492867534] [2024-10-14 13:51:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:51:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:51:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:51:53,821 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:53,883 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2024-10-14 13:51:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:51:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-14 13:51:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:53,889 INFO L225 Difference]: With dead ends: 204 [2024-10-14 13:51:53,890 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 13:51:53,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-14 13:51:53,896 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:51:53,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 407 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:51:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 13:51:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-14 13:51:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-14 13:51:53,910 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 131 [2024-10-14 13:51:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-14 13:51:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-14 13:51:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:53,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:53,914 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:53,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:51:53,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:53,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash -213359936, now seen corresponding path program 1 times [2024-10-14 13:51:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452963439] [2024-10-14 13:51:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:54,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:54,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452963439] [2024-10-14 13:51:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452963439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:51:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990422806] [2024-10-14 13:51:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:51:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:51:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:51:54,167 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:54,206 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-10-14 13:51:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:51:54,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-14 13:51:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:54,209 INFO L225 Difference]: With dead ends: 208 [2024-10-14 13:51:54,209 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 13:51:54,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-14 13:51:54,212 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:51:54,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:51:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 13:51:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 13:51:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-14 13:51:54,224 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2024-10-14 13:51:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:54,224 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-14 13:51:54,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-14 13:51:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:54,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:54,230 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:54,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:51:54,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:54,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash -156101634, now seen corresponding path program 1 times [2024-10-14 13:51:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524411473] [2024-10-14 13:51:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524411473] [2024-10-14 13:51:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524411473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:54,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:54,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:51:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958590761] [2024-10-14 13:51:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:54,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:51:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:51:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:51:54,391 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:54,421 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-14 13:51:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:51:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-14 13:51:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:54,423 INFO L225 Difference]: With dead ends: 212 [2024-10-14 13:51:54,423 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 13:51:54,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-14 13:51:54,425 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:51:54,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:51:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 13:51:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 13:51:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-14 13:51:54,432 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2024-10-14 13:51:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:54,433 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-14 13:51:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-14 13:51:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:54,435 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:54,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:51:54,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash -156042052, now seen corresponding path program 1 times [2024-10-14 13:51:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346393874] [2024-10-14 13:51:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:51:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346393874] [2024-10-14 13:51:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346393874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:51:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:51:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:51:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035566220] [2024-10-14 13:51:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:51:55,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:51:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:51:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:51:55,097 INFO L87 Difference]: Start difference. First operand 107 states and 153 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:55,405 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2024-10-14 13:51:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:51:55,406 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-14 13:51:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:55,408 INFO L225 Difference]: With dead ends: 301 [2024-10-14 13:51:55,408 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 13:51:55,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:51:55,413 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 253 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:51:55,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 611 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:51:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 13:51:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2024-10-14 13:51:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-14 13:51:55,429 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 131 [2024-10-14 13:51:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-14 13:51:55,430 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:51:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-14 13:51:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:55,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:55,432 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:55,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:51:55,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -541804589, now seen corresponding path program 1 times [2024-10-14 13:51:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916014299] [2024-10-14 13:51:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:51:56,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916014299] [2024-10-14 13:51:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916014299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:51:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883072377] [2024-10-14 13:51:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:51:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:51:56,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:51:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:51:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:56,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 13:51:56,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:51:57,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:51:57,331 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 29 [2024-10-14 13:51:57,354 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 11 treesize of output 7 [2024-10-14 13:51:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 4 proven. 252 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:51:57,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:51:57,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-14 13:51:57,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:51:57,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2024-10-14 13:51:57,702 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 48 treesize of output 40 [2024-10-14 13:51:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:51:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883072377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:51:57,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:51:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 19 [2024-10-14 13:51:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762333046] [2024-10-14 13:51:57,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:51:57,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 13:51:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:51:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 13:51:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:51:57,864 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 13:51:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:51:59,047 INFO L93 Difference]: Finished difference Result 335 states and 471 transitions. [2024-10-14 13:51:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 13:51:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-14 13:51:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:51:59,052 INFO L225 Difference]: With dead ends: 335 [2024-10-14 13:51:59,052 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 13:51:59,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 13:51:59,054 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 684 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:51:59,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1358 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:51:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 13:51:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 128. [2024-10-14 13:51:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:51:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2024-10-14 13:51:59,081 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 131 [2024-10-14 13:51:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:51:59,082 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2024-10-14 13:51:59,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 13:51:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2024-10-14 13:51:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:51:59,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:51:59,085 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:51:59,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:51:59,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:51:59,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:51:59,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:51:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1947724373, now seen corresponding path program 1 times [2024-10-14 13:51:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:51:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272261499] [2024-10-14 13:51:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:51:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:51:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:51:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:51:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:51:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:51:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:51:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:51:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:51:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:51:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:51:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:51:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:51:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:51:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:51:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:51:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:51:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:51:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:51:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:51:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:51:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272261499] [2024-10-14 13:51:59,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272261499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:51:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771403037] [2024-10-14 13:51:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:51:59,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:51:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:51:59,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:51:59,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:52:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:00,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:00,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:52:00,625 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 29 [2024-10-14 13:52:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-14 13:52:00,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:00,818 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 48 treesize of output 40 [2024-10-14 13:52:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:52:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771403037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:00,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:52:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2024-10-14 13:52:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928620906] [2024-10-14 13:52:00,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:52:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:52:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:52:00,939 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 13:52:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:01,516 INFO L93 Difference]: Finished difference Result 281 states and 394 transitions. [2024-10-14 13:52:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:52:01,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-14 13:52:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:01,519 INFO L225 Difference]: With dead ends: 281 [2024-10-14 13:52:01,519 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 13:52:01,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:01,520 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:01,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 732 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:52:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 13:52:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-14 13:52:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 121 states have internal predecessors, (157), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 13:52:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 211 transitions. [2024-10-14 13:52:01,547 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 211 transitions. Word has length 131 [2024-10-14 13:52:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:01,548 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 211 transitions. [2024-10-14 13:52:01,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 13:52:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 211 transitions. [2024-10-14 13:52:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:52:01,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:01,550 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:01,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:52:01,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 13:52:01,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1499995380, now seen corresponding path program 1 times [2024-10-14 13:52:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471520599] [2024-10-14 13:52:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:52:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471520599] [2024-10-14 13:52:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471520599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:52:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799142581] [2024-10-14 13:52:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:52:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:52:02,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:52:02,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 13:52:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:02,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 13:52:02,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:02,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:52:03,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-14 13:52:03,214 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 11 treesize of output 7 [2024-10-14 13:52:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 13:52:03,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:03,491 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 48 treesize of output 40 [2024-10-14 13:52:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:52:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799142581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:03,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:52:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-10-14 13:52:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214926849] [2024-10-14 13:52:03,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 13:52:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 13:52:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-14 13:52:03,627 INFO L87 Difference]: Start difference. First operand 151 states and 211 transitions. Second operand has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-14 13:52:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:04,593 INFO L93 Difference]: Finished difference Result 382 states and 526 transitions. [2024-10-14 13:52:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 13:52:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) Word has length 131 [2024-10-14 13:52:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:04,596 INFO L225 Difference]: With dead ends: 382 [2024-10-14 13:52:04,597 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 13:52:04,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 13:52:04,598 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 873 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:04,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1483 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:52:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 13:52:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-10-14 13:52:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 190 states have internal predecessors, (243), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 13:52:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 331 transitions. [2024-10-14 13:52:04,641 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 331 transitions. Word has length 131 [2024-10-14 13:52:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:04,641 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 331 transitions. [2024-10-14 13:52:04,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-14 13:52:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 331 transitions. [2024-10-14 13:52:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:52:04,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:04,644 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:04,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:04,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:52:04,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash -621274919, now seen corresponding path program 1 times [2024-10-14 13:52:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242246555] [2024-10-14 13:52:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:05,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:05,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242246555] [2024-10-14 13:52:05,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242246555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:05,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644110892] [2024-10-14 13:52:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:05,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:05,125 INFO L87 Difference]: Start difference. First operand 239 states and 331 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:05,248 INFO L93 Difference]: Finished difference Result 681 states and 939 transitions. [2024-10-14 13:52:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:52:05,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-14 13:52:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:05,252 INFO L225 Difference]: With dead ends: 681 [2024-10-14 13:52:05,253 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 13:52:05,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:52:05,254 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 140 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:05,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 994 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 13:52:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 247. [2024-10-14 13:52:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 198 states have internal predecessors, (253), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 13:52:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 341 transitions. [2024-10-14 13:52:05,285 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 341 transitions. Word has length 132 [2024-10-14 13:52:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 341 transitions. [2024-10-14 13:52:05,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 341 transitions. [2024-10-14 13:52:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:52:05,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:05,287 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:52:05,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -646180905, now seen corresponding path program 1 times [2024-10-14 13:52:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572179317] [2024-10-14 13:52:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:05,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572179317] [2024-10-14 13:52:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572179317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519338353] [2024-10-14 13:52:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:05,671 INFO L87 Difference]: Start difference. First operand 247 states and 341 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:05,840 INFO L93 Difference]: Finished difference Result 471 states and 649 transitions. [2024-10-14 13:52:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-14 13:52:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:05,843 INFO L225 Difference]: With dead ends: 471 [2024-10-14 13:52:05,843 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 13:52:05,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:52:05,845 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 224 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:05,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 356 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 13:52:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-14 13:52:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 13:52:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2024-10-14 13:52:05,875 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 132 [2024-10-14 13:52:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2024-10-14 13:52:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2024-10-14 13:52:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:05,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:05,877 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:52:05,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2054905927, now seen corresponding path program 1 times [2024-10-14 13:52:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710620926] [2024-10-14 13:52:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710620926] [2024-10-14 13:52:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710620926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:06,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:52:06,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647581692] [2024-10-14 13:52:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:52:06,112 INFO L87 Difference]: Start difference. First operand 243 states and 335 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:06,297 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2024-10-14 13:52:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:06,298 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:52:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:06,302 INFO L225 Difference]: With dead ends: 588 [2024-10-14 13:52:06,303 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 13:52:06,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-14 13:52:06,304 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 113 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:06,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 798 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 13:52:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 170. [2024-10-14 13:52:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 130 states have internal predecessors, (160), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-10-14 13:52:06,334 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 133 [2024-10-14 13:52:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:06,334 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-10-14 13:52:06,334 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-10-14 13:52:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:52:06,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:06,337 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:06,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:52:06,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:06,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1503991326, now seen corresponding path program 1 times [2024-10-14 13:52:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:06,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651897433] [2024-10-14 13:52:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651897433] [2024-10-14 13:52:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651897433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:06,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:06,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575179290] [2024-10-14 13:52:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:06,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:06,982 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:07,152 INFO L93 Difference]: Finished difference Result 361 states and 483 transitions. [2024-10-14 13:52:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-14 13:52:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:07,154 INFO L225 Difference]: With dead ends: 361 [2024-10-14 13:52:07,155 INFO L226 Difference]: Without dead ends: 243 [2024-10-14 13:52:07,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:52:07,156 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:07,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 711 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-14 13:52:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-10-14 13:52:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2552083333333333) internal successors, (241), 194 states have internal predecessors, (241), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 321 transitions. [2024-10-14 13:52:07,190 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 321 transitions. Word has length 134 [2024-10-14 13:52:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:07,191 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 321 transitions. [2024-10-14 13:52:07,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 321 transitions. [2024-10-14 13:52:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:52:07,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:07,194 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:52:07,194 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1230609614, now seen corresponding path program 1 times [2024-10-14 13:52:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483409497] [2024-10-14 13:52:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483409497] [2024-10-14 13:52:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483409497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:52:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258780903] [2024-10-14 13:52:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:52:07,448 INFO L87 Difference]: Start difference. First operand 240 states and 321 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:07,627 INFO L93 Difference]: Finished difference Result 567 states and 759 transitions. [2024-10-14 13:52:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-14 13:52:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:07,632 INFO L225 Difference]: With dead ends: 567 [2024-10-14 13:52:07,633 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 13:52:07,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-14 13:52:07,634 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:07,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 508 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 13:52:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 240. [2024-10-14 13:52:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 194 states have internal predecessors, (239), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2024-10-14 13:52:07,672 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 134 [2024-10-14 13:52:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2024-10-14 13:52:07,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2024-10-14 13:52:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:07,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:07,674 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:07,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:52:07,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:07,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2106226912, now seen corresponding path program 1 times [2024-10-14 13:52:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644865520] [2024-10-14 13:52:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644865520] [2024-10-14 13:52:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644865520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:08,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:08,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057211226] [2024-10-14 13:52:08,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:08,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:08,068 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:08,211 INFO L93 Difference]: Finished difference Result 428 states and 569 transitions. [2024-10-14 13:52:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:52:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:08,213 INFO L225 Difference]: With dead ends: 428 [2024-10-14 13:52:08,214 INFO L226 Difference]: Without dead ends: 240 [2024-10-14 13:52:08,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:52:08,216 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 131 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:08,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-14 13:52:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-14 13:52:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.234375) internal successors, (237), 194 states have internal predecessors, (237), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2024-10-14 13:52:08,248 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 135 [2024-10-14 13:52:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:08,248 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2024-10-14 13:52:08,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2024-10-14 13:52:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:08,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:08,250 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:08,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:52:08,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:08,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1085158558, now seen corresponding path program 1 times [2024-10-14 13:52:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327990703] [2024-10-14 13:52:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327990703] [2024-10-14 13:52:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327990703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:08,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:52:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329861556] [2024-10-14 13:52:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:08,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:52:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:52:08,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:52:08,944 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:09,153 INFO L93 Difference]: Finished difference Result 517 states and 681 transitions. [2024-10-14 13:52:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:52:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:52:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:09,156 INFO L225 Difference]: With dead ends: 517 [2024-10-14 13:52:09,156 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 13:52:09,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:52:09,157 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 46 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:09,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 991 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 13:52:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2024-10-14 13:52:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 202 states have (on average 1.2227722772277227) internal successors, (247), 204 states have internal predecessors, (247), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 327 transitions. [2024-10-14 13:52:09,189 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 327 transitions. Word has length 135 [2024-10-14 13:52:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 327 transitions. [2024-10-14 13:52:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 327 transitions. [2024-10-14 13:52:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:09,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:09,192 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:52:09,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1902807008, now seen corresponding path program 1 times [2024-10-14 13:52:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115795849] [2024-10-14 13:52:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115795849] [2024-10-14 13:52:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115795849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916862156] [2024-10-14 13:52:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:09,583 INFO L87 Difference]: Start difference. First operand 250 states and 327 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:09,735 INFO L93 Difference]: Finished difference Result 432 states and 567 transitions. [2024-10-14 13:52:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:52:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:09,738 INFO L225 Difference]: With dead ends: 432 [2024-10-14 13:52:09,738 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 13:52:09,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:52:09,739 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:09,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 347 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 13:52:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-14 13:52:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 186 states have (on average 1.2204301075268817) internal successors, (227), 188 states have internal predecessors, (227), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 307 transitions. [2024-10-14 13:52:09,772 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 307 transitions. Word has length 135 [2024-10-14 13:52:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:09,772 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 307 transitions. [2024-10-14 13:52:09,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 307 transitions. [2024-10-14 13:52:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 13:52:09,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:09,774 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:09,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 13:52:09,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:09,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 313186233, now seen corresponding path program 1 times [2024-10-14 13:52:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:09,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050075444] [2024-10-14 13:52:09,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:09,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050075444] [2024-10-14 13:52:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050075444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:10,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784008911] [2024-10-14 13:52:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:10,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:10,030 INFO L87 Difference]: Start difference. First operand 234 states and 307 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:10,349 INFO L93 Difference]: Finished difference Result 633 states and 831 transitions. [2024-10-14 13:52:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-14 13:52:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:10,352 INFO L225 Difference]: With dead ends: 633 [2024-10-14 13:52:10,353 INFO L226 Difference]: Without dead ends: 451 [2024-10-14 13:52:10,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:52:10,354 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 210 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:10,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 962 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:52:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-14 13:52:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2024-10-14 13:52:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.2350877192982457) internal successors, (352), 287 states have internal predecessors, (352), 57 states have call successors, (57), 10 states have call predecessors, (57), 10 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-14 13:52:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 466 transitions. [2024-10-14 13:52:10,432 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 466 transitions. Word has length 137 [2024-10-14 13:52:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:10,432 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 466 transitions. [2024-10-14 13:52:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 466 transitions. [2024-10-14 13:52:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:52:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:10,434 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:10,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:52:10,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:10,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1531003606, now seen corresponding path program 1 times [2024-10-14 13:52:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246923702] [2024-10-14 13:52:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:52:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:52:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:52:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:52:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:52:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:52:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:52:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:52:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:52:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:52:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:52:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:52:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:52:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:52:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:52:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:52:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 13:52:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:10,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:52:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246923702] [2024-10-14 13:52:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246923702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:10,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:52:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602316555] [2024-10-14 13:52:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:10,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:10,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:52:10,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:10,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:52:10,741 INFO L87 Difference]: Start difference. First operand 353 states and 466 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:10,849 INFO L93 Difference]: Finished difference Result 369 states and 482 transitions. [2024-10-14 13:52:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-14 13:52:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:10,852 INFO L225 Difference]: With dead ends: 369 [2024-10-14 13:52:10,852 INFO L226 Difference]: Without dead ends: 367 [2024-10-14 13:52:10,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-14 13:52:10,853 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:10,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 507 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-14 13:52:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-14 13:52:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 297 states have (on average 1.2255892255892256) internal successors, (364), 299 states have internal predecessors, (364), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-14 13:52:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 478 transitions. [2024-10-14 13:52:10,902 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 478 transitions. Word has length 138 [2024-10-14 13:52:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:10,902 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 478 transitions. [2024-10-14 13:52:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 478 transitions. [2024-10-14 13:52:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 13:52:10,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:10,904 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 13:52:10,904 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1531063188, now seen corresponding path program 1 times [2024-10-14 13:52:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:52:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413466130] [2024-10-14 13:52:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:52:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:52:10,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:52:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:52:11,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:52:11,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:52:11,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:52:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:52:11,183 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:52:11,348 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:52:11,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:52:11 BoogieIcfgContainer [2024-10-14 13:52:11,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:52:11,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:52:11,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:52:11,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:52:11,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:51:51" (3/4) ... [2024-10-14 13:52:11,354 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:52:11,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:52:11,356 INFO L158 Benchmark]: Toolchain (without parser) took 21057.80ms. Allocated memory was 159.4MB in the beginning and 578.8MB in the end (delta: 419.4MB). Free memory was 100.5MB in the beginning and 212.0MB in the end (delta: -111.5MB). Peak memory consumption was 309.8MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,357 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 159.4MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:52:11,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 85.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 82.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,358 INFO L158 Benchmark]: Boogie Preprocessor took 145.92ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 76.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,358 INFO L158 Benchmark]: RCFGBuilder took 1057.85ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 76.9MB in the beginning and 150.1MB in the end (delta: -73.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,361 INFO L158 Benchmark]: TraceAbstraction took 19381.06ms. Allocated memory was 218.1MB in the beginning and 578.8MB in the end (delta: 360.7MB). Free memory was 150.1MB in the beginning and 212.0MB in the end (delta: -61.9MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. [2024-10-14 13:52:11,361 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 578.8MB. Free memory is still 212.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:52:11,362 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.39ms. Allocated memory is still 159.4MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 85.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 82.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.92ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 76.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.85ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 76.9MB in the beginning and 150.1MB in the end (delta: -73.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19381.06ms. Allocated memory was 218.1MB in the beginning and 578.8MB in the end (delta: 360.7MB). Free memory was 150.1MB in the beginning and 212.0MB in the end (delta: -61.9MB). Peak memory consumption was 297.8MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 578.8MB. Free memory is still 212.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L22] signed short int var_1_1 = 16; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 32; [L24] signed short int var_1_7 = 32; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 20113; [L26] signed short int var_1_8 = 20113; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] signed short int var_1_9 = 100; [L28] signed short int var_1_9 = 100; [L29] signed short int* var_1_9_Pointer = &(var_1_9); [L30] signed char var_1_10 = 100; [L30] signed char var_1_10 = 100; [L31] signed char* var_1_10_Pointer = &(var_1_10); [L32] signed char var_1_11 = -1; [L32] signed char var_1_11 = -1; [L33] signed char* var_1_11_Pointer = &(var_1_11); [L34] signed char var_1_12 = 16; [L34] signed char var_1_12 = 16; [L35] signed char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_15 = 0; [L38] unsigned char var_1_15 = 0; [L39] unsigned char* var_1_15_Pointer = &(var_1_15); [L40] unsigned char var_1_16 = 1; [L40] unsigned char var_1_16 = 1; [L41] unsigned char* var_1_16_Pointer = &(var_1_16); [L42] unsigned short int var_1_18 = 10; [L42] unsigned short int var_1_18 = 10; [L43] unsigned short int* var_1_18_Pointer = &(var_1_18); [L44] unsigned short int var_1_19 = 256; [L44] unsigned short int var_1_19 = 256; [L45] unsigned short int* var_1_19_Pointer = &(var_1_19); [L46] float var_1_20 = 32.5; [L46] float var_1_20 = 32.5; [L47] float* var_1_20_Pointer = &(var_1_20); [L48] float var_1_21 = 127.4; [L48] float var_1_21 = 127.4; [L49] float* var_1_21_Pointer = &(var_1_21); [L50] signed short int var_1_22 = 128; [L50] signed short int var_1_22 = 128; [L51] signed short int* var_1_22_Pointer = &(var_1_22); [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L85] var_1_7 = __VERIFIER_nondet_short() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_8 = __VERIFIER_nondet_short() [L89] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] var_1_9 = __VERIFIER_nondet_short() [L92] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L94] var_1_11 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] var_1_12 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L106] var_1_19 = __VERIFIER_nondet_ushort() [L107] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L123] RET updateVariables() [L124] CALL step() [L55] EXPR \read(*var_1_19_Pointer) [L55] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L56] EXPR \read(*var_1_21_Pointer) [L56] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L57] EXPR \read(*var_1_12_Pointer) [L57] (*(var_1_22_Pointer)) = (*(var_1_12_Pointer)) [L58] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L58] COND TRUE 127.5f > (*(var_1_20_Pointer)) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] (*(var_1_13_Pointer)) = ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))) [L63] EXPR \read(*var_1_18_Pointer) [L63] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L63] COND TRUE (*(var_1_18_Pointer)) == (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)) [L72] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] COND TRUE (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] COND FALSE !((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) [L80] (*(var_1_1_Pointer)) = 8 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_11_Pointer) [L115] EXPR \read(*var_1_12_Pointer) [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) [L115] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) [L115] EXPR \read(*var_1_13_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_21_Pointer) [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115-L116] return ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3290 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 12488 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9389 mSDsCounter, 484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2991 IncrementalHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 484 mSolverCounterUnsat, 3099 mSDtfsCounter, 2991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1452 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=19, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 937 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 3051 NumberOfCodeBlocks, 3051 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3281 ConstructedInterpolants, 0 QuantifiedInterpolants, 12898 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 12690/13600 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-14 13:52:11,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:52:13,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:52:13,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:52:13,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:52:13,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:52:13,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:52:13,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:52:13,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:52:13,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:52:13,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:52:13,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:52:13,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:52:13,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:52:13,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:52:13,853 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:52:13,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:52:13,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:52:13,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:52:13,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:52:13,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:52:13,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:52:13,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:52:13,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:52:13,858 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:52:13,858 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:52:13,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:52:13,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:52:13,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:52:13,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:52:13,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:52:13,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:52:13,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:52:13,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:52:13,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:52:13,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:52:13,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:52:13,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:52:13,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:52:13,863 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:52:13,863 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:52:13,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:52:13,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:52:13,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:52:13,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:52:13,864 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:52:13,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-14 13:52:14,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:52:14,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:52:14,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:52:14,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:52:14,276 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:52:14,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:52:15,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:52:16,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:52:16,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:52:16,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043e9b242/c581ca9fc1d34db4a8328d5269519503/FLAG97bbad320 [2024-10-14 13:52:16,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043e9b242/c581ca9fc1d34db4a8328d5269519503 [2024-10-14 13:52:16,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:52:16,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:52:16,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:52:16,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:52:16,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:52:16,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8d60ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16, skipping insertion in model container [2024-10-14 13:52:16,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:52:16,661 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-97.i[916,929] [2024-10-14 13:52:16,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:52:16,760 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:52:16,773 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-97.i[916,929] [2024-10-14 13:52:16,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:52:16,844 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:52:16,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16 WrapperNode [2024-10-14 13:52:16,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:52:16,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:52:16,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:52:16,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:52:16,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,915 INFO L138 Inliner]: procedures = 33, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2024-10-14 13:52:16,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:52:16,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:52:16,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:52:16,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:52:16,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,993 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-14 13:52:16,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:16,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:52:17,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:52:17,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:52:17,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:52:17,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (1/1) ... [2024-10-14 13:52:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:52:17,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:52:17,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:52:17,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:52:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:52:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:52:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-14 13:52:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:52:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:52:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:52:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:52:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:52:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:52:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:52:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-14 13:52:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-14 13:52:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-14 13:52:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-14 13:52:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:52:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:52:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:52:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:52:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-14 13:52:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-14 13:52:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-14 13:52:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-14 13:52:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-14 13:52:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-14 13:52:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:52:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-14 13:52:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-14 13:52:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-14 13:52:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-14 13:52:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:52:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:52:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:52:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-14 13:52:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:52:17,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:52:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:52:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-14 13:52:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:52:17,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-14 13:52:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-14 13:52:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-14 13:52:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-14 13:52:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-14 13:52:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-14 13:52:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-14 13:52:17,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:52:17,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:52:18,065 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-10-14 13:52:18,065 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:52:18,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:52:18,131 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:52:18,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:18 BoogieIcfgContainer [2024-10-14 13:52:18,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:52:18,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:52:18,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:52:18,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:52:18,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:52:16" (1/3) ... [2024-10-14 13:52:18,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b620ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:18, skipping insertion in model container [2024-10-14 13:52:18,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:52:16" (2/3) ... [2024-10-14 13:52:18,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b620ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:52:18, skipping insertion in model container [2024-10-14 13:52:18,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:52:18" (3/3) ... [2024-10-14 13:52:18,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-14 13:52:18,159 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:52:18,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:52:18,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:52:18,244 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;@1079b395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:52:18,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:52:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:52:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:52:18,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:18,267 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:18,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -61911549, now seen corresponding path program 1 times [2024-10-14 13:52:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48943660] [2024-10-14 13:52:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:18,290 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-14 13:52:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:18,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:18,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:52:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:18,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:52:18,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-14 13:52:18,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:18,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48943660] [2024-10-14 13:52:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48943660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:52:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246809149] [2024-10-14 13:52:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:18,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:52:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:52:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:52:18,850 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:52:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:18,928 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2024-10-14 13:52:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:52:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-14 13:52:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:18,950 INFO L225 Difference]: With dead ends: 183 [2024-10-14 13:52:18,950 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 13:52:18,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-14 13:52:18,963 INFO L432 NwaCegarLoop]: 129 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, 129 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-14 13:52:18,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:52:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 13:52:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 13:52:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:52:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-14 13:52:19,016 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 129 [2024-10-14 13:52:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-14 13:52:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:52:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-14 13:52:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:52:19,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:19,023 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:19,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:52:19,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:19,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:19,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 94664801, now seen corresponding path program 1 times [2024-10-14 13:52:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362971924] [2024-10-14 13:52:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:19,228 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-14 13:52:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:19,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:19,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:52:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:19,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:19,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:20,527 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 42 treesize of output 26 [2024-10-14 13:52:20,563 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-14 13:52:20,593 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-14 13:52:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:52:20,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:21,247 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:21,248 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 30 treesize of output 25 [2024-10-14 13:52:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:21,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362971924] [2024-10-14 13:52:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362971924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:21,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:21,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032919893] [2024-10-14 13:52:21,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:21,434 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:23,226 INFO L93 Difference]: Finished difference Result 293 states and 415 transitions. [2024-10-14 13:52:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-14 13:52:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:23,230 INFO L225 Difference]: With dead ends: 293 [2024-10-14 13:52:23,232 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 13:52:23,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:23,237 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 750 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:23,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1496 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 13:52:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 13:52:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 106. [2024-10-14 13:52:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:52:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2024-10-14 13:52:23,273 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 129 [2024-10-14 13:52:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:23,276 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2024-10-14 13:52:23,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2024-10-14 13:52:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:52:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:23,280 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:23,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:23,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:23,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 517366627, now seen corresponding path program 1 times [2024-10-14 13:52:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:23,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580143034] [2024-10-14 13:52:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:23,483 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-14 13:52:23,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:23,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:52:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:23,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 13:52:23,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:24,468 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 42 treesize of output 26 [2024-10-14 13:52:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-14 13:52:24,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:24,850 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:24,851 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 30 treesize of output 25 [2024-10-14 13:52:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:24,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:24,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580143034] [2024-10-14 13:52:24,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580143034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:24,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:24,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-10-14 13:52:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591511391] [2024-10-14 13:52:24,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:24,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 13:52:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 13:52:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-14 13:52:24,994 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:25,861 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2024-10-14 13:52:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 13:52:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-14 13:52:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:25,864 INFO L225 Difference]: With dead ends: 241 [2024-10-14 13:52:25,864 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 13:52:25,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-10-14 13:52:25,866 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 347 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:25,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 808 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:52:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 13:52:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-14 13:52:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 13:52:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2024-10-14 13:52:25,892 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 129 [2024-10-14 13:52:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:25,893 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2024-10-14 13:52:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2024-10-14 13:52:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:52:25,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:25,898 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:25,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:26,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:26,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1872436698, now seen corresponding path program 1 times [2024-10-14 13:52:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108470814] [2024-10-14 13:52:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:26,101 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-14 13:52:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:26,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:26,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:52:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:26,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:26,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:27,050 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 42 treesize of output 26 [2024-10-14 13:52:27,069 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-14 13:52:27,094 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-14 13:52:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-14 13:52:27,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:27,521 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:27,522 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 30 treesize of output 25 [2024-10-14 13:52:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:27,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:27,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108470814] [2024-10-14 13:52:27,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108470814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:27,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:27,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621011566] [2024-10-14 13:52:27,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:27,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:27,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:27,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:27,653 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:29,422 INFO L93 Difference]: Finished difference Result 350 states and 473 transitions. [2024-10-14 13:52:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:29,423 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-14 13:52:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:29,425 INFO L225 Difference]: With dead ends: 350 [2024-10-14 13:52:29,425 INFO L226 Difference]: Without dead ends: 238 [2024-10-14 13:52:29,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:29,427 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 599 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:29,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1618 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 13:52:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-14 13:52:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2024-10-14 13:52:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 172 states have internal predecessors, (218), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 13:52:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 306 transitions. [2024-10-14 13:52:29,460 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 306 transitions. Word has length 129 [2024-10-14 13:52:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:29,460 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 306 transitions. [2024-10-14 13:52:29,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 306 transitions. [2024-10-14 13:52:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:52:29,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:29,463 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:29,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 13:52:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:29,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash 472302903, now seen corresponding path program 1 times [2024-10-14 13:52:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:29,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666332113] [2024-10-14 13:52:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:29,665 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-14 13:52:29,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:29,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:29,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 13:52:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:29,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:29,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:30,410 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 42 treesize of output 26 [2024-10-14 13:52:30,429 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-14 13:52:30,466 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-14 13:52:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:52:30,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:30,881 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:30,881 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 30 treesize of output 25 [2024-10-14 13:52:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:31,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666332113] [2024-10-14 13:52:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666332113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:31,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581239119] [2024-10-14 13:52:31,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:31,031 INFO L87 Difference]: Start difference. First operand 225 states and 306 transitions. Second operand has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:32,321 INFO L93 Difference]: Finished difference Result 482 states and 640 transitions. [2024-10-14 13:52:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-14 13:52:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:32,325 INFO L225 Difference]: With dead ends: 482 [2024-10-14 13:52:32,326 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 13:52:32,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:32,328 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 718 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:32,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1291 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:52:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 13:52:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 176. [2024-10-14 13:52:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.251908396946565) internal successors, (164), 132 states have internal predecessors, (164), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 232 transitions. [2024-10-14 13:52:32,356 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 232 transitions. Word has length 130 [2024-10-14 13:52:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:32,356 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 232 transitions. [2024-10-14 13:52:32,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2024-10-14 13:52:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:52:32,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:32,359 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:32,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 13:52:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:32,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:32,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -251343138, now seen corresponding path program 1 times [2024-10-14 13:52:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374705640] [2024-10-14 13:52:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:32,561 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-14 13:52:32,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:32,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:32,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 13:52:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:32,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:32,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:33,264 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 42 treesize of output 26 [2024-10-14 13:52:33,281 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-14 13:52:33,305 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-14 13:52:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-14 13:52:33,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:33,632 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:33,632 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 30 treesize of output 25 [2024-10-14 13:52:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:33,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:33,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374705640] [2024-10-14 13:52:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374705640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:33,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302946674] [2024-10-14 13:52:33,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:33,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:33,736 INFO L87 Difference]: Start difference. First operand 176 states and 232 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:35,087 INFO L93 Difference]: Finished difference Result 394 states and 521 transitions. [2024-10-14 13:52:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:35,087 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-14 13:52:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:35,089 INFO L225 Difference]: With dead ends: 394 [2024-10-14 13:52:35,089 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 13:52:35,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:35,092 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 408 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:35,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1657 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:52:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 13:52:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 166. [2024-10-14 13:52:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 122 states have internal predecessors, (148), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-10-14 13:52:35,132 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 130 [2024-10-14 13:52:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-10-14 13:52:35,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-10-14 13:52:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:52:35,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:35,135 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:35,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:35,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:35,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1638600763, now seen corresponding path program 1 times [2024-10-14 13:52:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480521734] [2024-10-14 13:52:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:35,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:35,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:35,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 13:52:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:35,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 13:52:35,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:35,602 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-14 13:52:35,622 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 37 treesize of output 25 [2024-10-14 13:52:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:35,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:35,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:35,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480521734] [2024-10-14 13:52:35,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480521734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:35,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185358802] [2024-10-14 13:52:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:35,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:35,641 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:35,775 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2024-10-14 13:52:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-14 13:52:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:35,778 INFO L225 Difference]: With dead ends: 381 [2024-10-14 13:52:35,778 INFO L226 Difference]: Without dead ends: 275 [2024-10-14 13:52:35,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:52:35,779 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:35,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1007 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-14 13:52:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-10-14 13:52:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.220472440944882) internal successors, (155), 128 states have internal predecessors, (155), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2024-10-14 13:52:35,809 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 132 [2024-10-14 13:52:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:35,810 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2024-10-14 13:52:35,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2024-10-14 13:52:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:35,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:35,812 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:35,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:36,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2016866472, now seen corresponding path program 1 times [2024-10-14 13:52:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256082965] [2024-10-14 13:52:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:36,014 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-14 13:52:36,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:36,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:36,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 13:52:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:36,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:36,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:36,794 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 42 treesize of output 26 [2024-10-14 13:52:36,808 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-14 13:52:36,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 13:52:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:52:36,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:37,121 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:37,121 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 30 treesize of output 25 [2024-10-14 13:52:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:37,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256082965] [2024-10-14 13:52:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256082965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:37,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:37,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511445504] [2024-10-14 13:52:37,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:37,233 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:38,283 INFO L93 Difference]: Finished difference Result 402 states and 525 transitions. [2024-10-14 13:52:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 133 [2024-10-14 13:52:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:38,285 INFO L225 Difference]: With dead ends: 402 [2024-10-14 13:52:38,285 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 13:52:38,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:38,287 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 542 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:38,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 829 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:52:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 13:52:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2024-10-14 13:52:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.237037037037037) internal successors, (167), 136 states have internal predecessors, (167), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2024-10-14 13:52:38,309 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 133 [2024-10-14 13:52:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:38,310 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2024-10-14 13:52:38,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2024-10-14 13:52:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:38,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:38,311 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:38,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 13:52:38,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:38,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:38,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash -22721766, now seen corresponding path program 1 times [2024-10-14 13:52:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308046105] [2024-10-14 13:52:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:38,514 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-14 13:52:38,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:38,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:38,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 13:52:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:38,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:52:38,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:38,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:38,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308046105] [2024-10-14 13:52:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308046105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:38,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:52:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280484293] [2024-10-14 13:52:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:38,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:52:38,796 INFO L87 Difference]: Start difference. First operand 180 states and 235 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:38,867 INFO L93 Difference]: Finished difference Result 305 states and 402 transitions. [2024-10-14 13:52:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:38,868 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:52:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:38,869 INFO L225 Difference]: With dead ends: 305 [2024-10-14 13:52:38,869 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 13:52:38,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:52:38,871 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:38,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 13:52:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-10-14 13:52:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 140 states have internal predecessors, (171), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 239 transitions. [2024-10-14 13:52:38,893 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 239 transitions. Word has length 133 [2024-10-14 13:52:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:38,894 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 239 transitions. [2024-10-14 13:52:38,894 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 239 transitions. [2024-10-14 13:52:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:38,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:38,896 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:38,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 13:52:39,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:39,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:39,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -832068392, now seen corresponding path program 1 times [2024-10-14 13:52:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687409376] [2024-10-14 13:52:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:39,098 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-14 13:52:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:39,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:39,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 13:52:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:39,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 13:52:39,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:39,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:39,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687409376] [2024-10-14 13:52:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687409376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240755020] [2024-10-14 13:52:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:39,445 INFO L87 Difference]: Start difference. First operand 184 states and 239 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:39,516 INFO L93 Difference]: Finished difference Result 311 states and 407 transitions. [2024-10-14 13:52:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:52:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:39,518 INFO L225 Difference]: With dead ends: 311 [2024-10-14 13:52:39,518 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 13:52:39,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:39,519 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:39,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 13:52:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-10-14 13:52:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2024-10-14 13:52:39,537 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 133 [2024-10-14 13:52:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:39,538 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2024-10-14 13:52:39,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2024-10-14 13:52:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:39,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:39,539 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:39,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 13:52:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:39,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -774810090, now seen corresponding path program 1 times [2024-10-14 13:52:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223239985] [2024-10-14 13:52:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:39,741 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-14 13:52:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:39,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:39,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 13:52:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:39,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:52:39,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:40,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:40,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:40,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223239985] [2024-10-14 13:52:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223239985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:40,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:40,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:52:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001235512] [2024-10-14 13:52:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:40,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:52:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:52:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:52:40,012 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:40,099 INFO L93 Difference]: Finished difference Result 315 states and 411 transitions. [2024-10-14 13:52:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:52:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:52:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:40,108 INFO L225 Difference]: With dead ends: 315 [2024-10-14 13:52:40,108 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 13:52:40,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:52:40,109 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:40,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 13:52:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2024-10-14 13:52:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 144 states have internal predecessors, (175), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2024-10-14 13:52:40,133 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 133 [2024-10-14 13:52:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:40,134 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2024-10-14 13:52:40,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2024-10-14 13:52:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:52:40,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:40,136 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:40,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 13:52:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:40,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:40,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash -774750508, now seen corresponding path program 1 times [2024-10-14 13:52:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:40,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254391266] [2024-10-14 13:52:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:40,337 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-14 13:52:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:40,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:40,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 13:52:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:40,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 13:52:40,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:40,997 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 37 treesize of output 25 [2024-10-14 13:52:41,000 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-14 13:52:41,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-14 13:52:41,257 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 30 treesize of output 18 [2024-10-14 13:52:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 13:52:42,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:42,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254391266] [2024-10-14 13:52:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254391266] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:52:42,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:52:42,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-14 13:52:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788692373] [2024-10-14 13:52:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:42,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:52:42,742 INFO L87 Difference]: Start difference. First operand 188 states and 243 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:43,054 INFO L93 Difference]: Finished difference Result 414 states and 536 transitions. [2024-10-14 13:52:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:43,055 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-14 13:52:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:43,057 INFO L225 Difference]: With dead ends: 414 [2024-10-14 13:52:43,057 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 13:52:43,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-14 13:52:43,059 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 180 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:43,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 553 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:52:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 13:52:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2024-10-14 13:52:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 13:52:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2024-10-14 13:52:43,083 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 133 [2024-10-14 13:52:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2024-10-14 13:52:43,084 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2024-10-14 13:52:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:52:43,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:43,085 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:43,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:43,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:43,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:43,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 164715940, now seen corresponding path program 1 times [2024-10-14 13:52:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142792349] [2024-10-14 13:52:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:43,287 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-14 13:52:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:43,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 13:52:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:43,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 13:52:43,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:45,007 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 18 treesize of output 14 [2024-10-14 13:52:45,113 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 28 treesize of output 24 [2024-10-14 13:52:45,231 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 23 treesize of output 15 [2024-10-14 13:52:45,497 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 124 treesize of output 100 [2024-10-14 13:52:45,505 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 93 treesize of output 73 [2024-10-14 13:52:45,517 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 78 treesize of output 62 [2024-10-14 13:52:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 29 proven. 365 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 13:52:45,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:45,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142792349] [2024-10-14 13:52:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142792349] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:52:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:52:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 32 [2024-10-14 13:52:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728953358] [2024-10-14 13:52:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:45,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:52:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:52:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-10-14 13:52:45,987 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:46,339 INFO L93 Difference]: Finished difference Result 391 states and 506 transitions. [2024-10-14 13:52:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-14 13:52:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:46,342 INFO L225 Difference]: With dead ends: 391 [2024-10-14 13:52:46,342 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 13:52:46,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 13:52:46,344 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:46,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 761 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:52:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 13:52:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-10-14 13:52:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 210 states have internal predecessors, (256), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 336 transitions. [2024-10-14 13:52:46,371 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 336 transitions. Word has length 134 [2024-10-14 13:52:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:46,371 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 336 transitions. [2024-10-14 13:52:46,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 336 transitions. [2024-10-14 13:52:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:52:46,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:46,373 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:46,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 13:52:46,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:46,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1548816646, now seen corresponding path program 1 times [2024-10-14 13:52:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334935936] [2024-10-14 13:52:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:46,575 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-14 13:52:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:46,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:46,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 13:52:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:46,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 13:52:46,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:47,280 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 37 treesize of output 25 [2024-10-14 13:52:47,282 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-14 13:52:47,455 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-14 13:52:47,460 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 31 treesize of output 19 [2024-10-14 13:52:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 13:52:48,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:48,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334935936] [2024-10-14 13:52:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334935936] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:52:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:52:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-14 13:52:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964808166] [2024-10-14 13:52:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:52:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:52:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:52:48,918 INFO L87 Difference]: Start difference. First operand 260 states and 336 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:49,190 INFO L93 Difference]: Finished difference Result 599 states and 777 transitions. [2024-10-14 13:52:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:52:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-14 13:52:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:49,194 INFO L225 Difference]: With dead ends: 599 [2024-10-14 13:52:49,194 INFO L226 Difference]: Without dead ends: 399 [2024-10-14 13:52:49,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-14 13:52:49,197 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 102 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:49,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 483 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:52:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-14 13:52:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 260. [2024-10-14 13:52:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2211538461538463) internal successors, (254), 210 states have internal predecessors, (254), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2024-10-14 13:52:49,232 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 134 [2024-10-14 13:52:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2024-10-14 13:52:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2024-10-14 13:52:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:49,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:49,234 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:49,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 13:52:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:49,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash 827705615, now seen corresponding path program 1 times [2024-10-14 13:52:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993419580] [2024-10-14 13:52:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:49,436 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-14 13:52:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:49,438 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:49,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 13:52:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:49,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 13:52:49,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:49,757 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 37 treesize of output 33 [2024-10-14 13:52:49,824 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 114 treesize of output 102 [2024-10-14 13:52:49,829 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 102 treesize of output 90 [2024-10-14 13:52:49,833 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 100 treesize of output 84 [2024-10-14 13:52:49,836 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 78 treesize of output 66 [2024-10-14 13:52:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:49,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:49,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993419580] [2024-10-14 13:52:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993419580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:52:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457126615] [2024-10-14 13:52:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:52:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:52:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:52:49,892 INFO L87 Difference]: Start difference. First operand 260 states and 334 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:50,263 INFO L93 Difference]: Finished difference Result 511 states and 656 transitions. [2024-10-14 13:52:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:52:50,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:52:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:50,267 INFO L225 Difference]: With dead ends: 511 [2024-10-14 13:52:50,267 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 13:52:50,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:52:50,268 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 94 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:50,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1083 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:52:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 13:52:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 265. [2024-10-14 13:52:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 213 states have (on average 1.2206572769953052) internal successors, (260), 215 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2024-10-14 13:52:50,294 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 135 [2024-10-14 13:52:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:50,294 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2024-10-14 13:52:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2024-10-14 13:52:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:50,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:50,296 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:50,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 13:52:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:50,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -193362739, now seen corresponding path program 1 times [2024-10-14 13:52:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672889951] [2024-10-14 13:52:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:50,498 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-14 13:52:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:50,499 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 13:52:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:50,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:50,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:51,171 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 42 treesize of output 26 [2024-10-14 13:52:51,184 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-14 13:52:51,209 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-14 13:52:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-14 13:52:51,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:51,512 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:51,512 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 30 treesize of output 25 [2024-10-14 13:52:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:51,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672889951] [2024-10-14 13:52:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672889951] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:51,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324166349] [2024-10-14 13:52:51,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:51,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:51,650 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:52,791 INFO L93 Difference]: Finished difference Result 647 states and 828 transitions. [2024-10-14 13:52:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-14 13:52:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:52,794 INFO L225 Difference]: With dead ends: 647 [2024-10-14 13:52:52,794 INFO L226 Difference]: Without dead ends: 442 [2024-10-14 13:52:52,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:52,796 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 850 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:52,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 835 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:52:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-14 13:52:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 273. [2024-10-14 13:52:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 223 states have internal predecessors, (268), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 348 transitions. [2024-10-14 13:52:52,825 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 348 transitions. Word has length 135 [2024-10-14 13:52:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:52,825 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 348 transitions. [2024-10-14 13:52:52,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 348 transitions. [2024-10-14 13:52:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:52,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:52,826 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:52,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:53,027 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:53,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -941276560, now seen corresponding path program 1 times [2024-10-14 13:52:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114092986] [2024-10-14 13:52:53,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:53,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:53,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 13:52:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:53,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:52:53,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:53,366 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-14 13:52:53,368 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 21 treesize of output 13 [2024-10-14 13:52:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:52:53,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:52:53,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:53,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114092986] [2024-10-14 13:52:53,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114092986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:52:53,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:52:53,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:52:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820506977] [2024-10-14 13:52:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:52:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:52:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:52:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:52:53,388 INFO L87 Difference]: Start difference. First operand 273 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:56,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:52:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:57,011 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2024-10-14 13:52:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:52:57,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-14 13:52:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:57,015 INFO L225 Difference]: With dead ends: 488 [2024-10-14 13:52:57,015 INFO L226 Difference]: Without dead ends: 275 [2024-10-14 13:52:57,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:52:57,017 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 176 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:57,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 521 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 13:52:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-14 13:52:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-10-14 13:52:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 223 states have internal predecessors, (267), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 347 transitions. [2024-10-14 13:52:57,051 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 347 transitions. Word has length 135 [2024-10-14 13:52:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:57,052 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 347 transitions. [2024-10-14 13:52:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:52:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2024-10-14 13:52:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:57,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:57,054 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:57,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 13:52:57,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:57,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:57,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash -15573882, now seen corresponding path program 1 times [2024-10-14 13:52:57,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:57,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017335471] [2024-10-14 13:52:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:57,257 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-14 13:52:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:57,260 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:57,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 13:52:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:52:57,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:52:57,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:52:57,952 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 42 treesize of output 26 [2024-10-14 13:52:57,965 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-14 13:52:57,985 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-14 13:52:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-14 13:52:57,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:52:58,304 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 13:52:58,304 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 30 treesize of output 25 [2024-10-14 13:52:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 13:52:58,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:52:58,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017335471] [2024-10-14 13:52:58,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017335471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:52:58,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:52:58,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-14 13:52:58,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447620210] [2024-10-14 13:52:58,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:52:58,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 13:52:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:52:58,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 13:52:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:52:58,397 INFO L87 Difference]: Start difference. First operand 273 states and 347 transitions. Second operand has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:52:59,678 INFO L93 Difference]: Finished difference Result 651 states and 826 transitions. [2024-10-14 13:52:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 13:52:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-14 13:52:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:52:59,681 INFO L225 Difference]: With dead ends: 651 [2024-10-14 13:52:59,681 INFO L226 Difference]: Without dead ends: 438 [2024-10-14 13:52:59,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 13:52:59,683 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 437 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:52:59,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1323 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:52:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-14 13:52:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 269. [2024-10-14 13:52:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 217 states have (on average 1.1981566820276497) internal successors, (260), 219 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:52:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 340 transitions. [2024-10-14 13:52:59,727 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 340 transitions. Word has length 135 [2024-10-14 13:52:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:52:59,727 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 340 transitions. [2024-10-14 13:52:59,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-14 13:52:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 340 transitions. [2024-10-14 13:52:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 13:52:59,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:52:59,729 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:52:59,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 13:52:59,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:52:59,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:52:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:52:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -218993786, now seen corresponding path program 1 times [2024-10-14 13:52:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:52:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108350067] [2024-10-14 13:52:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:52:59,930 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-14 13:52:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:52:59,938 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:52:59,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 13:53:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:53:00,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 13:53:00,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:53:00,686 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 42 treesize of output 26 [2024-10-14 13:53:00,698 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-14 13:53:00,723 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-14 13:53:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-14 13:53:00,736 INFO L311 TraceCheckSpWp]: Computing backward predicates...