./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.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 e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:00:30,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:00:30,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:00:30,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:00:30,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:00:30,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:00:30,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:00:30,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:00:30,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:00:30,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:00:30,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:00:30,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:00:30,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:00:30,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:00:30,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:00:30,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:00:30,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:00:30,312 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:00:30,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:00:30,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:00:30,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:00:30,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:00:30,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:00:30,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:00:30,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:00:30,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:00:30,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:00:30,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:00:30,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:00:30,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:00:30,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:00:30,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:00:30,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:00:30,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:00:30,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:00:30,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:00:30,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:00:30,319 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 -> e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 [2024-11-22 13:00:30,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:00:30,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:00:30,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:00:30,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:00:30,539 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:00:30,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:31,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:00:31,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:00:31,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:31,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd4395dc/da2b133c61fa4ce5baaa6f387dfd5139/FLAG5dbd93d36 [2024-11-22 13:00:31,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd4395dc/da2b133c61fa4ce5baaa6f387dfd5139 [2024-11-22 13:00:31,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:00:31,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:00:31,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:00:31,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:00:31,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:00:31,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:31" (1/1) ... [2024-11-22 13:00:31,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5b7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:31, skipping insertion in model container [2024-11-22 13:00:31,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:31" (1/1) ... [2024-11-22 13:00:31,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:00:32,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-11-22 13:00:32,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:00:32,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:00:32,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-11-22 13:00:32,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:00:32,191 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:00:32,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32 WrapperNode [2024-11-22 13:00:32,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:00:32,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:00:32,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:00:32,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:00:32,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,233 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-11-22 13:00:32,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:00:32,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:00:32,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:00:32,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:00:32,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,275 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 7, 10, 14, 16, 8, 4, 6, 8, 4, 8, 9, 6, 9, 3, 8]. 13 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 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1]. [2024-11-22 13:00:32,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:00:32,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:00:32,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:00:32,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:00:32,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (1/1) ... [2024-11-22 13:00:32,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:00:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:00:32,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:00:32,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:00:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:00:32,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 13:00:32,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 13:00:32,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 13:00:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 13:00:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 13:00:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 13:00:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-22 13:00:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-22 13:00:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-22 13:00:32,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-22 13:00:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 13:00:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 13:00:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 13:00:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 13:00:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 13:00:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-22 13:00:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-22 13:00:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-22 13:00:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-22 13:00:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-22 13:00:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-22 13:00:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-22 13:00:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 13:00:32,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-22 13:00:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:00:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:00:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 13:00:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-22 13:00:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-22 13:00:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-22 13:00:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-22 13:00:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:00:32,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:00:32,560 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:00:32,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:00:32,953 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-22 13:00:32,953 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:00:32,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:00:32,967 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:00:32,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:32 BoogieIcfgContainer [2024-11-22 13:00:32,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:00:32,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:00:32,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:00:32,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:00:32,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:00:31" (1/3) ... [2024-11-22 13:00:32,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100dba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:32, skipping insertion in model container [2024-11-22 13:00:32,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:32" (2/3) ... [2024-11-22 13:00:32,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100dba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:32, skipping insertion in model container [2024-11-22 13:00:32,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:32" (3/3) ... [2024-11-22 13:00:32,973 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:32,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:00:32,986 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:00:33,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:00:33,047 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;@fd8e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:00:33,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:00:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:00:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 13:00:33,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:33,064 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:33,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:33,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 557809999, now seen corresponding path program 1 times [2024-11-22 13:00:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:33,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922588767] [2024-11-22 13:00:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:33,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 13:00:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922588767] [2024-11-22 13:00:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922588767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:00:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730731291] [2024-11-22 13:00:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:00:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:00:33,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:00:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:00:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:33,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:00:33,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 13:00:33,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730731291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:33,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:00:33,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:00:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106088754] [2024-11-22 13:00:33,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:33,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:00:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:00:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:00:33,737 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:00:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:33,759 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-22 13:00:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:00:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-22 13:00:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:33,765 INFO L225 Difference]: With dead ends: 199 [2024-11-22 13:00:33,765 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 13:00:33,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:00:33,772 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:33,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 13:00:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 13:00:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:00:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-22 13:00:33,815 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-22 13:00:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-22 13:00:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:00:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-22 13:00:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 13:00:33,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:33,820 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:33,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:00:34,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:00:34,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:34,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 665716147, now seen corresponding path program 1 times [2024-11-22 13:00:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824745811] [2024-11-22 13:00:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:34,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824745811] [2024-11-22 13:00:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824745811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:00:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147516661] [2024-11-22 13:00:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:34,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:00:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:00:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:00:34,369 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:34,403 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-22 13:00:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:00:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-22 13:00:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:34,410 INFO L225 Difference]: With dead ends: 198 [2024-11-22 13:00:34,410 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 13:00:34,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:00:34,411 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:34,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 13:00:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-22 13:00:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:00:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-22 13:00:34,426 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2024-11-22 13:00:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:34,427 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-22 13:00:34,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-22 13:00:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 13:00:34,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:34,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:34,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:00:34,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:34,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 667563189, now seen corresponding path program 1 times [2024-11-22 13:00:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312786624] [2024-11-22 13:00:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312786624] [2024-11-22 13:00:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312786624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:34,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:34,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:00:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882780348] [2024-11-22 13:00:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:00:34,682 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:34,876 INFO L93 Difference]: Finished difference Result 324 states and 459 transitions. [2024-11-22 13:00:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:34,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-22 13:00:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:34,879 INFO L225 Difference]: With dead ends: 324 [2024-11-22 13:00:34,880 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 13:00:34,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:00:34,881 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 209 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:34,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 483 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 13:00:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 199. [2024-11-22 13:00:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 13:00:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2024-11-22 13:00:34,896 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 150 [2024-11-22 13:00:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:34,897 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2024-11-22 13:00:34,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2024-11-22 13:00:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 13:00:34,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:34,899 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:34,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:00:34,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:34,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash -329940525, now seen corresponding path program 1 times [2024-11-22 13:00:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538525813] [2024-11-22 13:00:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538525813] [2024-11-22 13:00:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538525813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 13:00:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056936231] [2024-11-22 13:00:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:35,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:00:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:00:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:00:35,856 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:36,045 INFO L93 Difference]: Finished difference Result 485 states and 685 transitions. [2024-11-22 13:00:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:00:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-22 13:00:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:36,048 INFO L225 Difference]: With dead ends: 485 [2024-11-22 13:00:36,050 INFO L226 Difference]: Without dead ends: 289 [2024-11-22 13:00:36,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-22 13:00:36,053 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 61 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:36,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1037 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-22 13:00:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2024-11-22 13:00:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3105263157894738) internal successors, (249), 190 states have internal predecessors, (249), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 13:00:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-11-22 13:00:36,081 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 158 [2024-11-22 13:00:36,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:36,083 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-11-22 13:00:36,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-11-22 13:00:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:36,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:36,084 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:36,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:00:36,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash 634758488, now seen corresponding path program 1 times [2024-11-22 13:00:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:36,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918124556] [2024-11-22 13:00:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918124556] [2024-11-22 13:00:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918124556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:00:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680389997] [2024-11-22 13:00:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:00:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:00:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:36,549 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:36,708 INFO L93 Difference]: Finished difference Result 575 states and 807 transitions. [2024-11-22 13:00:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:00:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:36,710 INFO L225 Difference]: With dead ends: 575 [2024-11-22 13:00:36,710 INFO L226 Difference]: Without dead ends: 345 [2024-11-22 13:00:36,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:00:36,711 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 61 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:36,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 837 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-22 13:00:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2024-11-22 13:00:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 292 states have (on average 1.3287671232876712) internal successors, (388), 294 states have internal predecessors, (388), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 13:00:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2024-11-22 13:00:36,730 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 160 [2024-11-22 13:00:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:36,730 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2024-11-22 13:00:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2024-11-22 13:00:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:36,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:36,732 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:00:36,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -386309866, now seen corresponding path program 1 times [2024-11-22 13:00:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177696252] [2024-11-22 13:00:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177696252] [2024-11-22 13:00:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177696252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:37,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:00:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286445600] [2024-11-22 13:00:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:37,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:00:37,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:00:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:00:37,362 INFO L87 Difference]: Start difference. First operand 341 states and 476 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:37,809 INFO L93 Difference]: Finished difference Result 688 states and 956 transitions. [2024-11-22 13:00:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:00:37,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-22 13:00:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:37,812 INFO L225 Difference]: With dead ends: 688 [2024-11-22 13:00:37,813 INFO L226 Difference]: Without dead ends: 350 [2024-11-22 13:00:37,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:00:37,819 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 283 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:37,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 738 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:00:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-22 13:00:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 337. [2024-11-22 13:00:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 288 states have (on average 1.3194444444444444) internal successors, (380), 290 states have internal predecessors, (380), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 13:00:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 468 transitions. [2024-11-22 13:00:37,845 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 468 transitions. Word has length 160 [2024-11-22 13:00:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:37,846 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 468 transitions. [2024-11-22 13:00:37,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 468 transitions. [2024-11-22 13:00:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:37,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:37,849 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:37,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:00:37,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -383894516, now seen corresponding path program 1 times [2024-11-22 13:00:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624581905] [2024-11-22 13:00:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:00:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624581905] [2024-11-22 13:00:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624581905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:00:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753025584] [2024-11-22 13:00:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:38,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:00:38,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:00:38,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:00:38,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:00:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:38,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:00:38,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:38,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753025584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:00:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 13:00:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304143638] [2024-11-22 13:00:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:38,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:38,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:38,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:38,275 INFO L87 Difference]: Start difference. First operand 337 states and 468 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:38,311 INFO L93 Difference]: Finished difference Result 683 states and 949 transitions. [2024-11-22 13:00:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:38,314 INFO L225 Difference]: With dead ends: 683 [2024-11-22 13:00:38,314 INFO L226 Difference]: Without dead ends: 349 [2024-11-22 13:00:38,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:38,315 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:38,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-22 13:00:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-22 13:00:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 300 states have (on average 1.3066666666666666) internal successors, (392), 302 states have internal predecessors, (392), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 13:00:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 480 transitions. [2024-11-22 13:00:38,335 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 480 transitions. Word has length 160 [2024-11-22 13:00:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:38,336 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 480 transitions. [2024-11-22 13:00:38,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 480 transitions. [2024-11-22 13:00:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:38,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:38,338 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:38,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 13:00:38,541 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,SelfDestructingSolverStorable6 [2024-11-22 13:00:38,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:38,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash -642059954, now seen corresponding path program 1 times [2024-11-22 13:00:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:38,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395975691] [2024-11-22 13:00:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395975691] [2024-11-22 13:00:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395975691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:00:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042438620] [2024-11-22 13:00:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:00:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:00:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:00:39,058 INFO L87 Difference]: Start difference. First operand 349 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:39,176 INFO L93 Difference]: Finished difference Result 935 states and 1277 transitions. [2024-11-22 13:00:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:00:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:39,179 INFO L225 Difference]: With dead ends: 935 [2024-11-22 13:00:39,179 INFO L226 Difference]: Without dead ends: 589 [2024-11-22 13:00:39,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-11-22 13:00:39,180 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 56 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:39,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 678 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-22 13:00:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 573. [2024-11-22 13:00:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 508 states have (on average 1.3169291338582678) internal successors, (669), 514 states have internal predecessors, (669), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:00:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 781 transitions. [2024-11-22 13:00:39,208 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 781 transitions. Word has length 160 [2024-11-22 13:00:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:39,208 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 781 transitions. [2024-11-22 13:00:39,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 781 transitions. [2024-11-22 13:00:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:39,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:39,210 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:39,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:00:39,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:39,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2082808520, now seen corresponding path program 1 times [2024-11-22 13:00:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477076847] [2024-11-22 13:00:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477076847] [2024-11-22 13:00:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477076847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:39,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:00:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090713264] [2024-11-22 13:00:39,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:00:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:00:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:39,587 INFO L87 Difference]: Start difference. First operand 573 states and 781 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:39,734 INFO L93 Difference]: Finished difference Result 1365 states and 1852 transitions. [2024-11-22 13:00:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:00:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:39,738 INFO L225 Difference]: With dead ends: 1365 [2024-11-22 13:00:39,738 INFO L226 Difference]: Without dead ends: 795 [2024-11-22 13:00:39,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:00:39,740 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 58 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:39,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 781 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-22 13:00:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 643. [2024-11-22 13:00:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 578 states have (on average 1.320069204152249) internal successors, (763), 584 states have internal predecessors, (763), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:00:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 875 transitions. [2024-11-22 13:00:39,782 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 875 transitions. Word has length 160 [2024-11-22 13:00:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:39,782 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 875 transitions. [2024-11-22 13:00:39,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 875 transitions. [2024-11-22 13:00:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:39,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:39,784 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:39,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:00:39,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 218014070, now seen corresponding path program 1 times [2024-11-22 13:00:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629766798] [2024-11-22 13:00:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629766798] [2024-11-22 13:00:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629766798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:00:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844635702] [2024-11-22 13:00:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:00:40,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:00:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:40,226 INFO L87 Difference]: Start difference. First operand 643 states and 875 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:40,542 INFO L93 Difference]: Finished difference Result 1290 states and 1750 transitions. [2024-11-22 13:00:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:00:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-22 13:00:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:40,545 INFO L225 Difference]: With dead ends: 1290 [2024-11-22 13:00:40,545 INFO L226 Difference]: Without dead ends: 650 [2024-11-22 13:00:40,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:00:40,547 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 381 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:40,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 469 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-22 13:00:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 635. [2024-11-22 13:00:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 570 states have (on average 1.3105263157894738) internal successors, (747), 576 states have internal predecessors, (747), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:00:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 859 transitions. [2024-11-22 13:00:40,579 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 859 transitions. Word has length 160 [2024-11-22 13:00:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:40,579 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 859 transitions. [2024-11-22 13:00:40,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 859 transitions. [2024-11-22 13:00:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:40,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:40,581 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:00:40,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -501511344, now seen corresponding path program 1 times [2024-11-22 13:00:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377587733] [2024-11-22 13:00:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:40,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377587733] [2024-11-22 13:00:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377587733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:40,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:00:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008732028] [2024-11-22 13:00:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:40,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:40,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:00:40,763 INFO L87 Difference]: Start difference. First operand 635 states and 859 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:40,848 INFO L93 Difference]: Finished difference Result 1304 states and 1760 transitions. [2024-11-22 13:00:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:40,851 INFO L225 Difference]: With dead ends: 1304 [2024-11-22 13:00:40,852 INFO L226 Difference]: Without dead ends: 672 [2024-11-22 13:00:40,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:00:40,853 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 66 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:40,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 743 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-22 13:00:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 668. [2024-11-22 13:00:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 588 states have (on average 1.2942176870748299) internal successors, (761), 595 states have internal predecessors, (761), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 13:00:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 897 transitions. [2024-11-22 13:00:40,887 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 897 transitions. Word has length 160 [2024-11-22 13:00:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:40,887 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 897 transitions. [2024-11-22 13:00:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 897 transitions. [2024-11-22 13:00:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:40,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:40,889 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:40,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:00:40,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash 657390742, now seen corresponding path program 1 times [2024-11-22 13:00:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:40,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486967079] [2024-11-22 13:00:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486967079] [2024-11-22 13:00:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486967079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:00:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213051145] [2024-11-22 13:00:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:00:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:41,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:00:41,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:00:41,335 INFO L87 Difference]: Start difference. First operand 668 states and 897 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:41,699 INFO L93 Difference]: Finished difference Result 1630 states and 2181 transitions. [2024-11-22 13:00:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 13:00:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-22 13:00:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:41,704 INFO L225 Difference]: With dead ends: 1630 [2024-11-22 13:00:41,705 INFO L226 Difference]: Without dead ends: 978 [2024-11-22 13:00:41,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:00:41,708 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 318 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:41,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 771 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-22 13:00:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 614. [2024-11-22 13:00:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 538 states have (on average 1.295539033457249) internal successors, (697), 543 states have internal predecessors, (697), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:00:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 825 transitions. [2024-11-22 13:00:41,739 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 825 transitions. Word has length 160 [2024-11-22 13:00:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:41,739 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 825 transitions. [2024-11-22 13:00:41,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 825 transitions. [2024-11-22 13:00:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:41,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:41,741 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:41,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:00:41,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:41,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -363677612, now seen corresponding path program 1 times [2024-11-22 13:00:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:41,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182671945] [2024-11-22 13:00:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182671945] [2024-11-22 13:00:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182671945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:42,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:00:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919630898] [2024-11-22 13:00:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:00:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:42,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:00:42,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:42,091 INFO L87 Difference]: Start difference. First operand 614 states and 825 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:42,399 INFO L93 Difference]: Finished difference Result 1374 states and 1834 transitions. [2024-11-22 13:00:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:00:42,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-22 13:00:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:42,402 INFO L225 Difference]: With dead ends: 1374 [2024-11-22 13:00:42,402 INFO L226 Difference]: Without dead ends: 776 [2024-11-22 13:00:42,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:00:42,403 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:42,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 538 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-22 13:00:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 614. [2024-11-22 13:00:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 538 states have (on average 1.29182156133829) internal successors, (695), 543 states have internal predecessors, (695), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:00:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 823 transitions. [2024-11-22 13:00:42,449 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 823 transitions. Word has length 160 [2024-11-22 13:00:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:42,449 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 823 transitions. [2024-11-22 13:00:42,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 823 transitions. [2024-11-22 13:00:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:42,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:42,451 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:42,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:00:42,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:42,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1559550422, now seen corresponding path program 1 times [2024-11-22 13:00:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183262495] [2024-11-22 13:00:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183262495] [2024-11-22 13:00:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183262495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:00:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687654411] [2024-11-22 13:00:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:00:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:00:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:00:42,757 INFO L87 Difference]: Start difference. First operand 614 states and 823 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:42,961 INFO L93 Difference]: Finished difference Result 1398 states and 1857 transitions. [2024-11-22 13:00:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:00:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:00:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:42,965 INFO L225 Difference]: With dead ends: 1398 [2024-11-22 13:00:42,965 INFO L226 Difference]: Without dead ends: 800 [2024-11-22 13:00:42,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:00:42,967 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 62 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:42,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 942 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:00:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-22 13:00:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 731. [2024-11-22 13:00:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 649 states have internal predecessors, (823), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 967 transitions. [2024-11-22 13:00:43,007 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 967 transitions. Word has length 160 [2024-11-22 13:00:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:43,007 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 967 transitions. [2024-11-22 13:00:43,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 967 transitions. [2024-11-22 13:00:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:00:43,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:43,009 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:43,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:00:43,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:43,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 240646324, now seen corresponding path program 1 times [2024-11-22 13:00:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200759060] [2024-11-22 13:00:43,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200759060] [2024-11-22 13:00:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200759060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 13:00:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379759832] [2024-11-22 13:00:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:43,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 13:00:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 13:00:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-22 13:00:43,706 INFO L87 Difference]: Start difference. First operand 731 states and 967 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-22 13:00:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:44,239 INFO L93 Difference]: Finished difference Result 1633 states and 2142 transitions. [2024-11-22 13:00:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:00:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 160 [2024-11-22 13:00:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:44,243 INFO L225 Difference]: With dead ends: 1633 [2024-11-22 13:00:44,243 INFO L226 Difference]: Without dead ends: 905 [2024-11-22 13:00:44,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-22 13:00:44,245 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 181 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:44,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1194 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:00:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-22 13:00:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 738. [2024-11-22 13:00:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 649 states have (on average 1.2727272727272727) internal successors, (826), 656 states have internal predecessors, (826), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 970 transitions. [2024-11-22 13:00:44,288 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 970 transitions. Word has length 160 [2024-11-22 13:00:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:44,289 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 970 transitions. [2024-11-22 13:00:44,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-22 13:00:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 970 transitions. [2024-11-22 13:00:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:44,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:44,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 13:00:44,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1574974333, now seen corresponding path program 1 times [2024-11-22 13:00:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31803729] [2024-11-22 13:00:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31803729] [2024-11-22 13:00:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31803729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 13:00:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298337979] [2024-11-22 13:00:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 13:00:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 13:00:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:00:44,816 INFO L87 Difference]: Start difference. First operand 738 states and 970 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:45,130 INFO L93 Difference]: Finished difference Result 1659 states and 2180 transitions. [2024-11-22 13:00:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:00:45,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:00:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:45,134 INFO L225 Difference]: With dead ends: 1659 [2024-11-22 13:00:45,134 INFO L226 Difference]: Without dead ends: 924 [2024-11-22 13:00:45,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:00:45,136 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 57 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:45,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1284 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-22 13:00:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 798. [2024-11-22 13:00:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 709 states have (on average 1.2778561354019746) internal successors, (906), 716 states have internal predecessors, (906), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1050 transitions. [2024-11-22 13:00:45,200 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1050 transitions. Word has length 162 [2024-11-22 13:00:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1050 transitions. [2024-11-22 13:00:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1050 transitions. [2024-11-22 13:00:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:45,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:45,203 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 13:00:45,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash 295110655, now seen corresponding path program 1 times [2024-11-22 13:00:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474634594] [2024-11-22 13:00:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474634594] [2024-11-22 13:00:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474634594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:45,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:00:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861994399] [2024-11-22 13:00:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:00:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:00:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:00:45,624 INFO L87 Difference]: Start difference. First operand 798 states and 1050 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:46,047 INFO L93 Difference]: Finished difference Result 1744 states and 2284 transitions. [2024-11-22 13:00:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:00:46,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-22 13:00:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:46,051 INFO L225 Difference]: With dead ends: 1744 [2024-11-22 13:00:46,052 INFO L226 Difference]: Without dead ends: 949 [2024-11-22 13:00:46,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:00:46,053 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 200 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:46,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 650 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:00:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-22 13:00:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 801. [2024-11-22 13:00:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 712 states have (on average 1.2668539325842696) internal successors, (902), 719 states have internal predecessors, (902), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1046 transitions. [2024-11-22 13:00:46,100 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1046 transitions. Word has length 162 [2024-11-22 13:00:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1046 transitions. [2024-11-22 13:00:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1046 transitions. [2024-11-22 13:00:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:46,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:46,102 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:46,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 13:00:46,102 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:46,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1333789569, now seen corresponding path program 1 times [2024-11-22 13:00:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351119564] [2024-11-22 13:00:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351119564] [2024-11-22 13:00:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351119564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:00:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654005602] [2024-11-22 13:00:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:00:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:00:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:46,478 INFO L87 Difference]: Start difference. First operand 801 states and 1046 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:46,746 INFO L93 Difference]: Finished difference Result 1533 states and 2005 transitions. [2024-11-22 13:00:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:00:46,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-22 13:00:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:46,749 INFO L225 Difference]: With dead ends: 1533 [2024-11-22 13:00:46,750 INFO L226 Difference]: Without dead ends: 735 [2024-11-22 13:00:46,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:00:46,751 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 131 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:46,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 431 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-22 13:00:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-22 13:00:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 646 states have (on average 1.263157894736842) internal successors, (816), 653 states have internal predecessors, (816), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 960 transitions. [2024-11-22 13:00:46,792 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 960 transitions. Word has length 162 [2024-11-22 13:00:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:46,792 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 960 transitions. [2024-11-22 13:00:46,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 960 transitions. [2024-11-22 13:00:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:46,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:46,794 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:46,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 13:00:46,794 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:46,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1586754338, now seen corresponding path program 1 times [2024-11-22 13:00:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096949916] [2024-11-22 13:00:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 13:00:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096949916] [2024-11-22 13:00:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096949916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:00:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592880862] [2024-11-22 13:00:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:00:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:00:46,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:00:46,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:00:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:47,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:00:47,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:47,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592880862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:00:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 13:00:47,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460053125] [2024-11-22 13:00:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:47,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:47,170 INFO L87 Difference]: Start difference. First operand 735 states and 960 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:47,218 INFO L93 Difference]: Finished difference Result 1494 states and 1953 transitions. [2024-11-22 13:00:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:00:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:47,222 INFO L225 Difference]: With dead ends: 1494 [2024-11-22 13:00:47,222 INFO L226 Difference]: Without dead ends: 762 [2024-11-22 13:00:47,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:00:47,223 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:47,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-22 13:00:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2024-11-22 13:00:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 673 states have (on average 1.2526002971768202) internal successors, (843), 680 states have internal predecessors, (843), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 987 transitions. [2024-11-22 13:00:47,263 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 987 transitions. Word has length 162 [2024-11-22 13:00:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:47,263 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 987 transitions. [2024-11-22 13:00:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2024-11-22 13:00:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:47,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:47,265 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:47,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:00:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:00:47,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1241792635, now seen corresponding path program 1 times [2024-11-22 13:00:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297570798] [2024-11-22 13:00:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297570798] [2024-11-22 13:00:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297570798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 13:00:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535297666] [2024-11-22 13:00:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 13:00:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 13:00:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 13:00:47,874 INFO L87 Difference]: Start difference. First operand 762 states and 987 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:48,343 INFO L93 Difference]: Finished difference Result 1663 states and 2146 transitions. [2024-11-22 13:00:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:00:48,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-22 13:00:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:48,348 INFO L225 Difference]: With dead ends: 1663 [2024-11-22 13:00:48,348 INFO L226 Difference]: Without dead ends: 904 [2024-11-22 13:00:48,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:00:48,350 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 193 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:48,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 809 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:00:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-22 13:00:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 762. [2024-11-22 13:00:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 673 states have (on average 1.2466567607726597) internal successors, (839), 680 states have internal predecessors, (839), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 983 transitions. [2024-11-22 13:00:48,420 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 983 transitions. Word has length 162 [2024-11-22 13:00:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 983 transitions. [2024-11-22 13:00:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-22 13:00:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 983 transitions. [2024-11-22 13:00:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:00:48,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:48,422 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 13:00:48,423 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -38071043, now seen corresponding path program 1 times [2024-11-22 13:00:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497919962] [2024-11-22 13:00:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:48,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497919962] [2024-11-22 13:00:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497919962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 13:00:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019946408] [2024-11-22 13:00:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:48,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 13:00:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 13:00:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:00:48,880 INFO L87 Difference]: Start difference. First operand 762 states and 983 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:49,161 INFO L93 Difference]: Finished difference Result 1631 states and 2102 transitions. [2024-11-22 13:00:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:00:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:00:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:49,165 INFO L225 Difference]: With dead ends: 1631 [2024-11-22 13:00:49,165 INFO L226 Difference]: Without dead ends: 872 [2024-11-22 13:00:49,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:00:49,167 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 52 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:49,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1562 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-22 13:00:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 749. [2024-11-22 13:00:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 660 states have (on average 1.2454545454545454) internal successors, (822), 667 states have internal predecessors, (822), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 966 transitions. [2024-11-22 13:00:49,220 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 966 transitions. Word has length 162 [2024-11-22 13:00:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:49,220 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 966 transitions. [2024-11-22 13:00:49,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:49,221 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 966 transitions. [2024-11-22 13:00:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:00:49,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:49,222 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:49,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 13:00:49,222 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1731578697, now seen corresponding path program 1 times [2024-11-22 13:00:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092811700] [2024-11-22 13:00:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:00:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092811700] [2024-11-22 13:00:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092811700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:00:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248120527] [2024-11-22 13:00:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:49,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:00:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:00:49,363 INFO L87 Difference]: Start difference. First operand 749 states and 966 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:49,443 INFO L93 Difference]: Finished difference Result 1507 states and 1938 transitions. [2024-11-22 13:00:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-22 13:00:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:49,447 INFO L225 Difference]: With dead ends: 1507 [2024-11-22 13:00:49,447 INFO L226 Difference]: Without dead ends: 761 [2024-11-22 13:00:49,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:00:49,448 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:49,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 514 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-22 13:00:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 757. [2024-11-22 13:00:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 666 states have (on average 1.2372372372372373) internal successors, (824), 673 states have internal predecessors, (824), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 13:00:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 968 transitions. [2024-11-22 13:00:49,489 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 968 transitions. Word has length 164 [2024-11-22 13:00:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 968 transitions. [2024-11-22 13:00:49,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 968 transitions. [2024-11-22 13:00:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:00:49,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:49,491 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 13:00:49,491 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -710510343, now seen corresponding path program 1 times [2024-11-22 13:00:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:00:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879792405] [2024-11-22 13:00:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:00:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:00:49,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:00:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:00:49,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:00:49,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:00:49,792 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:00:49,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 13:00:49,796 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, 1, 1, 1] [2024-11-22 13:00:49,953 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:00:49,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:00:49 BoogieIcfgContainer [2024-11-22 13:00:49,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:00:49,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:00:49,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:00:49,956 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:00:49,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:32" (3/4) ... [2024-11-22 13:00:49,958 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:00:49,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:00:49,960 INFO L158 Benchmark]: Toolchain (without parser) took 18091.78ms. Allocated memory was 153.1MB in the beginning and 750.8MB in the end (delta: 597.7MB). Free memory was 84.6MB in the beginning and 325.4MB in the end (delta: -240.8MB). Peak memory consumption was 359.7MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,960 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:00:49,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.91ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 116.4MB in the end (delta: -32.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 153.1MB. Free memory was 116.4MB in the beginning and 112.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,961 INFO L158 Benchmark]: Boogie Preprocessor took 77.35ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 105.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,961 INFO L158 Benchmark]: RCFGBuilder took 655.26ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 59.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,961 INFO L158 Benchmark]: TraceAbstraction took 16986.66ms. Allocated memory was 153.1MB in the beginning and 750.8MB in the end (delta: 597.7MB). Free memory was 58.7MB in the beginning and 325.4MB in the end (delta: -266.7MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. [2024-11-22 13:00:49,961 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 750.8MB. Free memory is still 325.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:00:49,962 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.15ms. Allocated memory is still 153.1MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.91ms. Allocated memory is still 153.1MB. Free memory was 84.4MB in the beginning and 116.4MB in the end (delta: -32.0MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 153.1MB. Free memory was 116.4MB in the beginning and 112.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.35ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 105.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 655.26ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 59.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16986.66ms. Allocated memory was 153.1MB in the beginning and 750.8MB in the end (delta: 597.7MB). Free memory was 58.7MB in the beginning and 325.4MB in the end (delta: -266.7MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 750.8MB. Free memory is still 325.4MB. 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] unsigned char var_1_1 = 128; [L22] unsigned char var_1_1 = 128; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 25; [L24] unsigned char var_1_4 = 25; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 64; [L26] unsigned char var_1_5 = 64; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 8; [L28] unsigned char var_1_6 = 8; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 0; [L30] unsigned char var_1_7 = 0; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned short int var_1_8 = 64; [L32] unsigned short int var_1_8 = 64; [L33] unsigned short int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 1; [L34] unsigned char var_1_9 = 1; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned short int var_1_10 = 27843; [L36] unsigned short int var_1_10 = 27843; [L37] unsigned short int* var_1_10_Pointer = &(var_1_10); [L38] signed short int var_1_11 = -4; [L38] signed short int var_1_11 = -4; [L39] signed short int* var_1_11_Pointer = &(var_1_11); [L40] unsigned char var_1_13 = 128; [L40] unsigned char var_1_13 = 128; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 5; [L42] unsigned char var_1_14 = 5; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] signed short int var_1_15 = 28020; [L44] signed short int var_1_15 = 28020; [L45] signed short int* var_1_15_Pointer = &(var_1_15); [L46] signed short int var_1_16 = 128; [L46] signed short int var_1_16 = 128; [L47] signed short int* var_1_16_Pointer = &(var_1_16); [L48] float var_1_17 = 10000000000000.926; [L48] float var_1_17 = 10000000000000.926; [L49] float* var_1_17_Pointer = &(var_1_17); [L50] float var_1_18 = 1000000.6; [L50] float var_1_18 = 1000000.6; [L51] float* var_1_18_Pointer = &(var_1_18); [L52] unsigned short int last_1_var_1_8 = 64; [L53] signed short int last_1_var_1_11 = -4; VAL [isInitial=0, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L111] EXPR \read(var_1_8) [L111] last_1_var_1_8 = var_1_8 [L112] EXPR \read(var_1_11) [L112] last_1_var_1_11 = var_1_11 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L79] var_1_4 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_5 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_6 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] var_1_10 = __VERIFIER_nondet_ushort() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_13 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_13 >= 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_14 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_14 != 127) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] var_1_15 = __VERIFIER_nondet_short() [L105] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_18 = __VERIFIER_nondet_float() [L108] EXPR \read(var_1_18) [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F [L108] EXPR \read(var_1_18) [L108] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L123] RET updateVariables() [L124] CALL step() [L57] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, stepLocal_0=-4, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L58] COND TRUE stepLocal_0 != last_1_var_1_8 [L59] EXPR \read(*var_1_4_Pointer) [L59] EXPR \read(*var_1_5_Pointer) [L59] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) [L59] EXPR \read(*var_1_5_Pointer) [L59] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) [L59] EXPR \read(*var_1_7_Pointer) [L59] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] (*(var_1_1_Pointer)) = ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))) [L63] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] COND TRUE (*(var_1_9_Pointer)) [L64] EXPR \read(*var_1_10_Pointer) [L64] EXPR \read(*var_1_6_Pointer) [L64] (*(var_1_8_Pointer)) = (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))) [L66] EXPR \read(*var_1_5_Pointer) [L66] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L66] COND TRUE ! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer))) [L67] (*(var_1_16_Pointer)) = (32 - 8) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] EXPR \read(*var_1_18_Pointer) [L71] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L72] EXPR \read(*var_1_1_Pointer) [L72] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] COND FALSE !((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR (last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer)))) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_4_Pointer) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR (((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) [L115] EXPR \read(*var_1_7_Pointer) [L115] EXPR (((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) [L115] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1 [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_6_Pointer) [L115] EXPR (*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1 VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1 [L115] EXPR ((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))) [L115] EXPR \read(*var_1_16_Pointer) [L115] EXPR (! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR ((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) [L115] EXPR \read(*var_1_17_Pointer) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L115-L116] return (((((last_1_var_1_11 != last_1_var_1_8) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) + (((((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) > ((*(var_1_7_Pointer)))) ? ((((((*(var_1_5_Pointer))) < ((*(var_1_6_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_6_Pointer)))))) : ((*(var_1_7_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_4_Pointer))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((*(var_1_10_Pointer)) + 23103) - (32 + (*(var_1_6_Pointer)))))) : 1)) && (((*(var_1_1_Pointer)) < (*(var_1_16_Pointer))) ? ((((- 8) / ((*(var_1_13_Pointer)) - (*(var_1_14_Pointer)))) >= (*(var_1_6_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed short int) ((*(var_1_16_Pointer)) - ((*(var_1_15_Pointer)) - (*(var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(var_1_5_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(var_1_16_Pointer)) == ((signed short int) ((*(var_1_13_Pointer)) - (*(var_1_4_Pointer))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-4, last_1_var_1_8=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 23, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2656 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2656 mSDsluCounter, 16077 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12706 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4718 IncrementalHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 3371 mSDtfsCounter, 4718 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 752 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=17, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1593 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 4140 NumberOfCodeBlocks, 4140 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3951 ConstructedInterpolants, 0 QuantifiedInterpolants, 9983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1983 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 18848/19000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 13:00:49,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.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 e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:00:51,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:00:51,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:00:51,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:00:51,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:00:51,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:00:51,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:00:51,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:00:51,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:00:51,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:00:51,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:00:51,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:00:51,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:00:51,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:00:51,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:00:51,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:00:51,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:00:51,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:00:51,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:00:51,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:00:51,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:00:51,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:00:51,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:00:51,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:00:51,927 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:00:51,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:00:51,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:00:51,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:00:51,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:00:51,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:00:51,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:00:51,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:00:51,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:00:51,931 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:00:51,932 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:00:51,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:00:51,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:00:51,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:00:51,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:00:51,939 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 -> e5c5150a720fdced1e7cf7a03c2f6f18e193ebaeb85e2a46b50fbe0597998c07 [2024-11-22 13:00:52,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:00:52,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:00:52,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:00:52,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:00:52,181 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:00:52,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:53,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:00:53,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:00:53,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:53,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d8bf70b/3a75ec99c23e4a258e19829b75f2f8bd/FLAGd11f434ee [2024-11-22 13:00:53,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d8bf70b/3a75ec99c23e4a258e19829b75f2f8bd [2024-11-22 13:00:53,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:00:53,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:00:53,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:00:53,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:00:53,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:00:53,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:53" (1/1) ... [2024-11-22 13:00:53,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dafcedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:53, skipping insertion in model container [2024-11-22 13:00:53,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:00:53" (1/1) ... [2024-11-22 13:00:54,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:00:54,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-11-22 13:00:54,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:00:54,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:00:54,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-84.i[916,929] [2024-11-22 13:00:54,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:00:54,249 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:00:54,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54 WrapperNode [2024-11-22 13:00:54,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:00:54,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:00:54,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:00:54,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:00:54,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,297 INFO L138 Inliner]: procedures = 33, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-22 13:00:54,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:00:54,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:00:54,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:00:54,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:00:54,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,335 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 7, 10, 14, 16, 8, 4, 6, 8, 4, 8, 9, 6, 9, 3, 8]. 13 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 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1]. [2024-11-22 13:00:54,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:00:54,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:00:54,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:00:54,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:00:54,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (1/1) ... [2024-11-22 13:00:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:00:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:00:54,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:00:54,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-22 13:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-22 13:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-22 13:00:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-22 13:00:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-22 13:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 13:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 13:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-22 13:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 13:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-22 13:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-22 13:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-22 13:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-22 13:00:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-22 13:00:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:00:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:00:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:00:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-22 13:00:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-22 13:00:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-22 13:00:54,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-22 13:00:54,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-11-22 13:00:54,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:00:54,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:00:55,239 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-22 13:00:55,239 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:00:55,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:00:55,252 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:00:55,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:55 BoogieIcfgContainer [2024-11-22 13:00:55,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:00:55,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:00:55,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:00:55,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:00:55,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:00:53" (1/3) ... [2024-11-22 13:00:55,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d27e8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:55, skipping insertion in model container [2024-11-22 13:00:55,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:00:54" (2/3) ... [2024-11-22 13:00:55,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d27e8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:00:55, skipping insertion in model container [2024-11-22 13:00:55,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:00:55" (3/3) ... [2024-11-22 13:00:55,262 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-84.i [2024-11-22 13:00:55,274 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:00:55,274 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:00:55,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:00:55,339 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;@49862319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:00:55,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:00:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:00:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 13:00:55,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:55,354 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:55,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 557809999, now seen corresponding path program 1 times [2024-11-22 13:00:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:00:55,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617397969] [2024-11-22 13:00:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:00:55,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:00:55,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 13:00:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:55,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:00:55,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-22 13:00:55,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:55,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:00:55,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617397969] [2024-11-22 13:00:55,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617397969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:55,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:55,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:00:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795200842] [2024-11-22 13:00:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:55,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:00:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:00:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:00:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:00:55,782 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:00:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:55,812 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-22 13:00:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:00:55,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-22 13:00:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:55,821 INFO L225 Difference]: With dead ends: 199 [2024-11-22 13:00:55,821 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 13:00:55,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:00:55,827 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:55,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 13:00:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 13:00:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 13:00:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-22 13:00:55,859 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-22 13:00:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:55,859 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-22 13:00:55,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:00:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-22 13:00:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-22 13:00:55,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:55,862 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:55,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 13:00:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:56,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 665716147, now seen corresponding path program 1 times [2024-11-22 13:00:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:00:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097560018] [2024-11-22 13:00:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:00:56,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:00:56,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 13:00:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:56,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:00:56,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:56,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 17 treesize of output 9 [2024-11-22 13:00:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:56,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:56,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:00:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097560018] [2024-11-22 13:00:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097560018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:00:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032458804] [2024-11-22 13:00:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:00:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:00:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:00:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:00:56,744 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:56,957 INFO L93 Difference]: Finished difference Result 322 states and 460 transitions. [2024-11-22 13:00:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:00:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-22 13:00:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:56,961 INFO L225 Difference]: With dead ends: 322 [2024-11-22 13:00:56,963 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 13:00:56,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:00:56,966 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 206 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:56,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 536 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:00:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 13:00:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 195. [2024-11-22 13:00:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 13:00:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2024-11-22 13:00:57,007 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 150 [2024-11-22 13:00:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:57,008 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2024-11-22 13:00:57,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2024-11-22 13:00:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 13:00:57,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:57,010 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:57,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 13:00:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:57,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash -331787567, now seen corresponding path program 1 times [2024-11-22 13:00:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:00:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415564611] [2024-11-22 13:00:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:57,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:57,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:00:57,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:00:57,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 13:00:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:57,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:00:57,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:00:57,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:00:57,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:00:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415564611] [2024-11-22 13:00:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415564611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:00:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:00:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:00:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694115737] [2024-11-22 13:00:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:00:57,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:00:57,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:00:57,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:00:57,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:00:57,559 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:00:57,617 INFO L93 Difference]: Finished difference Result 401 states and 573 transitions. [2024-11-22 13:00:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:00:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-22 13:00:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:00:57,621 INFO L225 Difference]: With dead ends: 401 [2024-11-22 13:00:57,623 INFO L226 Difference]: Without dead ends: 209 [2024-11-22 13:00:57,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:00:57,625 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:00:57,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:00:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-22 13:00:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-22 13:00:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 164 states have internal predecessors, (210), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 13:00:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-22 13:00:57,653 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 158 [2024-11-22 13:00:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:00:57,654 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-22 13:00:57,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:00:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-22 13:00:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 13:00:57,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:00:57,656 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:00:57,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 13:00:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:57,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:00:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:00:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -329940525, now seen corresponding path program 1 times [2024-11-22 13:00:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:00:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866382274] [2024-11-22 13:00:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:00:57,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:00:57,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:00:57,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:00:57,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 13:00:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:00:58,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 13:00:58,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:00:58,515 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 27 treesize of output 23 [2024-11-22 13:00:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-22 13:00:58,569 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 28 treesize of output 20 [2024-11-22 13:00:58,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 13:00:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-22 13:00:58,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:00,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:00,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866382274] [2024-11-22 13:01:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866382274] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:00,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:00,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2024-11-22 13:01:00,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023186426] [2024-11-22 13:01:00,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:00,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:01:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:00,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:01:00,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-22 13:01:00,899 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:01,240 INFO L93 Difference]: Finished difference Result 509 states and 709 transitions. [2024-11-22 13:01:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:01:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-22 13:01:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:01,242 INFO L225 Difference]: With dead ends: 509 [2024-11-22 13:01:01,242 INFO L226 Difference]: Without dead ends: 305 [2024-11-22 13:01:01,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:01:01,244 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:01,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1070 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:01:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-22 13:01:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 241. [2024-11-22 13:01:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 198 states have (on average 1.297979797979798) internal successors, (257), 198 states have internal predecessors, (257), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 13:01:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions. [2024-11-22 13:01:01,256 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 337 transitions. Word has length 158 [2024-11-22 13:01:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:01,257 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 337 transitions. [2024-11-22 13:01:01,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 337 transitions. [2024-11-22 13:01:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:01,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:01,259 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:01,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 13:01:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:01,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 634758488, now seen corresponding path program 1 times [2024-11-22 13:01:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80116245] [2024-11-22 13:01:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:01,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:01,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:01,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 13:01:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:01,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 13:01:01,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:02,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-22 13:01:02,823 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 20 treesize of output 12 [2024-11-22 13:01:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 457 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 13:01:02,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:03,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80116245] [2024-11-22 13:01:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80116245] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:03,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-22 13:01:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10978156] [2024-11-22 13:01:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:03,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:01:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:03,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:01:03,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:01:03,146 INFO L87 Difference]: Start difference. First operand 241 states and 337 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:03,347 INFO L93 Difference]: Finished difference Result 599 states and 831 transitions. [2024-11-22 13:01:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:01:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:03,351 INFO L225 Difference]: With dead ends: 599 [2024-11-22 13:01:03,351 INFO L226 Difference]: Without dead ends: 361 [2024-11-22 13:01:03,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:01:03,352 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 174 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:03,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 712 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-22 13:01:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2024-11-22 13:01:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 308 states have (on average 1.3116883116883118) internal successors, (404), 310 states have internal predecessors, (404), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 13:01:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2024-11-22 13:01:03,366 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 160 [2024-11-22 13:01:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:03,367 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2024-11-22 13:01:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2024-11-22 13:01:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:03,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:03,368 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:03,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:03,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -386309866, now seen corresponding path program 1 times [2024-11-22 13:01:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284358380] [2024-11-22 13:01:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:03,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:03,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 13:01:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:03,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 13:01:03,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:05,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-22 13:01:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 14 proven. 470 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 13:01:05,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:05,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284358380] [2024-11-22 13:01:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284358380] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:05,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:05,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 30 [2024-11-22 13:01:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676940085] [2024-11-22 13:01:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:01:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:01:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-22 13:01:05,976 INFO L87 Difference]: Start difference. First operand 357 states and 492 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:06,508 INFO L93 Difference]: Finished difference Result 923 states and 1263 transitions. [2024-11-22 13:01:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:01:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:06,515 INFO L225 Difference]: With dead ends: 923 [2024-11-22 13:01:06,515 INFO L226 Difference]: Without dead ends: 569 [2024-11-22 13:01:06,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 13:01:06,518 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 164 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:06,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 999 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:01:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-22 13:01:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 365. [2024-11-22 13:01:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 316 states have (on average 1.3196202531645569) internal successors, (417), 318 states have internal predecessors, (417), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 13:01:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 505 transitions. [2024-11-22 13:01:06,534 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 505 transitions. Word has length 160 [2024-11-22 13:01:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:06,535 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 505 transitions. [2024-11-22 13:01:06,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 505 transitions. [2024-11-22 13:01:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:06,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:06,536 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:06,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 13:01:06,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:06,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -383894516, now seen corresponding path program 1 times [2024-11-22 13:01:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270427868] [2024-11-22 13:01:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:06,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:06,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 13:01:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:06,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 13:01:06,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:07,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 13:01:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 426 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 13:01:07,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:07,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270427868] [2024-11-22 13:01:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270427868] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:07,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-22 13:01:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381662994] [2024-11-22 13:01:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:07,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:01:07,510 INFO L87 Difference]: Start difference. First operand 365 states and 505 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:07,569 INFO L93 Difference]: Finished difference Result 989 states and 1361 transitions. [2024-11-22 13:01:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:07,572 INFO L225 Difference]: With dead ends: 989 [2024-11-22 13:01:07,572 INFO L226 Difference]: Without dead ends: 627 [2024-11-22 13:01:07,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:01:07,573 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 530 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-11-22 13:01:07,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 530 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:01:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-22 13:01:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2024-11-22 13:01:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 550 states have (on average 1.3163636363636364) internal successors, (724), 556 states have internal predecessors, (724), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 852 transitions. [2024-11-22 13:01:07,591 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 852 transitions. Word has length 160 [2024-11-22 13:01:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:07,592 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 852 transitions. [2024-11-22 13:01:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 852 transitions. [2024-11-22 13:01:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:07,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:07,593 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:07,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 13:01:07,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:07,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash -642059954, now seen corresponding path program 1 times [2024-11-22 13:01:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3573377] [2024-11-22 13:01:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:07,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:07,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 13:01:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:08,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 13:01:08,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:09,085 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 31 treesize of output 27 [2024-11-22 13:01:09,262 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 94 [2024-11-22 13:01:09,269 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 77 [2024-11-22 13:01:09,274 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 72 treesize of output 60 [2024-11-22 13:01:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 28 proven. 552 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 13:01:09,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:09,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3573377] [2024-11-22 13:01:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3573377] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:09,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:09,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 23 [2024-11-22 13:01:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867748522] [2024-11-22 13:01:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:09,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:01:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:09,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:01:09,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:01:09,546 INFO L87 Difference]: Start difference. First operand 623 states and 852 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:09,766 INFO L93 Difference]: Finished difference Result 1279 states and 1741 transitions. [2024-11-22 13:01:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:01:09,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:09,770 INFO L225 Difference]: With dead ends: 1279 [2024-11-22 13:01:09,770 INFO L226 Difference]: Without dead ends: 659 [2024-11-22 13:01:09,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:01:09,772 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:09,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 678 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-22 13:01:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 656. [2024-11-22 13:01:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 576 states have (on average 1.2951388888888888) internal successors, (746), 583 states have internal predecessors, (746), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 13:01:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 882 transitions. [2024-11-22 13:01:09,792 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 882 transitions. Word has length 160 [2024-11-22 13:01:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:09,792 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 882 transitions. [2024-11-22 13:01:09,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 882 transitions. [2024-11-22 13:01:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:09,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:09,794 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:09,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:09,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:09,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2082808520, now seen corresponding path program 1 times [2024-11-22 13:01:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237251461] [2024-11-22 13:01:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:09,999 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 13:01:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:10,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 13:01:10,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:11,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 13:01:11,177 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-11-22 13:01:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 457 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-22 13:01:11,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:11,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237251461] [2024-11-22 13:01:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237251461] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-22 13:01:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127270358] [2024-11-22 13:01:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:01:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:01:11,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:01:11,425 INFO L87 Difference]: Start difference. First operand 656 states and 882 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:11,615 INFO L93 Difference]: Finished difference Result 1530 states and 2046 transitions. [2024-11-22 13:01:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:01:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:11,622 INFO L225 Difference]: With dead ends: 1530 [2024-11-22 13:01:11,622 INFO L226 Difference]: Without dead ends: 890 [2024-11-22 13:01:11,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:01:11,624 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 165 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:11,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 644 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-22 13:01:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 726. [2024-11-22 13:01:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 646 states have (on average 1.3003095975232197) internal successors, (840), 653 states have internal predecessors, (840), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 13:01:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 976 transitions. [2024-11-22 13:01:11,648 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 976 transitions. Word has length 160 [2024-11-22 13:01:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:11,650 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 976 transitions. [2024-11-22 13:01:11,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 976 transitions. [2024-11-22 13:01:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:11,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:11,652 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:11,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 13:01:11,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:11,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 218014070, now seen corresponding path program 1 times [2024-11-22 13:01:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401145450] [2024-11-22 13:01:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:11,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:11,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:11,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:11,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 13:01:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:12,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:12,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:12,927 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-11-22 13:01:12,931 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 29 treesize of output 17 [2024-11-22 13:01:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:12,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:13,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401145450] [2024-11-22 13:01:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401145450] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:13,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:13,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263656532] [2024-11-22 13:01:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:13,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:13,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:13,096 INFO L87 Difference]: Start difference. First operand 726 states and 976 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:13,225 INFO L93 Difference]: Finished difference Result 1600 states and 2132 transitions. [2024-11-22 13:01:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:13,230 INFO L225 Difference]: With dead ends: 1600 [2024-11-22 13:01:13,230 INFO L226 Difference]: Without dead ends: 890 [2024-11-22 13:01:13,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:13,233 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 511 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-11-22 13:01:13,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 511 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-22 13:01:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 718. [2024-11-22 13:01:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 638 states have (on average 1.2852664576802508) internal successors, (820), 645 states have internal predecessors, (820), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 13:01:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 956 transitions. [2024-11-22 13:01:13,257 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 956 transitions. Word has length 160 [2024-11-22 13:01:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:13,257 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 956 transitions. [2024-11-22 13:01:13,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 956 transitions. [2024-11-22 13:01:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:13,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:13,258 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:13,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:13,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:13,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:13,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash -501511344, now seen corresponding path program 1 times [2024-11-22 13:01:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037892224] [2024-11-22 13:01:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:13,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:13,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:13,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 13:01:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:13,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 13:01:13,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 10 proven. 426 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 13:01:14,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:14,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037892224] [2024-11-22 13:01:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037892224] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-22 13:01:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514183446] [2024-11-22 13:01:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:14,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:14,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:01:14,128 INFO L87 Difference]: Start difference. First operand 718 states and 956 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:14,192 INFO L93 Difference]: Finished difference Result 1420 states and 1886 transitions. [2024-11-22 13:01:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:14,195 INFO L225 Difference]: With dead ends: 1420 [2024-11-22 13:01:14,195 INFO L226 Difference]: Without dead ends: 718 [2024-11-22 13:01:14,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:01:14,197 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 116 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:14,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 549 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:01:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-22 13:01:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 714. [2024-11-22 13:01:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 632 states have (on average 1.2753164556962024) internal successors, (806), 639 states have internal predecessors, (806), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-22 13:01:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 942 transitions. [2024-11-22 13:01:14,215 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 942 transitions. Word has length 160 [2024-11-22 13:01:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 942 transitions. [2024-11-22 13:01:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 942 transitions. [2024-11-22 13:01:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:14,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:14,217 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:14,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 13:01:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:14,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:14,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 657390742, now seen corresponding path program 1 times [2024-11-22 13:01:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383000638] [2024-11-22 13:01:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:14,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:14,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 13:01:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:14,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:15,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-22 13:01:15,369 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-11-22 13:01:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:15,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:15,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:15,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383000638] [2024-11-22 13:01:15,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383000638] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:15,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:15,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478223274] [2024-11-22 13:01:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:15,547 INFO L87 Difference]: Start difference. First operand 714 states and 942 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:15,655 INFO L93 Difference]: Finished difference Result 1662 states and 2166 transitions. [2024-11-22 13:01:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:15,659 INFO L225 Difference]: With dead ends: 1662 [2024-11-22 13:01:15,660 INFO L226 Difference]: Without dead ends: 964 [2024-11-22 13:01:15,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:15,661 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 70 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:15,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 553 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-22 13:01:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 609. [2024-11-22 13:01:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 541 states have (on average 1.2883548983364141) internal successors, (697), 545 states have internal predecessors, (697), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:01:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 809 transitions. [2024-11-22 13:01:15,680 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 809 transitions. Word has length 160 [2024-11-22 13:01:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:15,681 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 809 transitions. [2024-11-22 13:01:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 809 transitions. [2024-11-22 13:01:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:15,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:15,682 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:15,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 13:01:15,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:15,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:15,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1714348520, now seen corresponding path program 1 times [2024-11-22 13:01:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665761836] [2024-11-22 13:01:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:15,886 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:15,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 13:01:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:16,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:16,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:16,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-22 13:01:16,849 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-11-22 13:01:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:16,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:17,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665761836] [2024-11-22 13:01:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665761836] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:17,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58531408] [2024-11-22 13:01:17,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:17,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:17,029 INFO L87 Difference]: Start difference. First operand 609 states and 809 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:17,126 INFO L93 Difference]: Finished difference Result 1385 states and 1816 transitions. [2024-11-22 13:01:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:17,129 INFO L225 Difference]: With dead ends: 1385 [2024-11-22 13:01:17,129 INFO L226 Difference]: Without dead ends: 779 [2024-11-22 13:01:17,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:17,130 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 112 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:17,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 439 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-22 13:01:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 601. [2024-11-22 13:01:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 533 states have (on average 1.2701688555347093) internal successors, (677), 537 states have internal predecessors, (677), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:01:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 789 transitions. [2024-11-22 13:01:17,147 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 789 transitions. Word has length 160 [2024-11-22 13:01:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:17,147 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 789 transitions. [2024-11-22 13:01:17,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 789 transitions. [2024-11-22 13:01:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:17,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:17,148 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:17,157 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-11-22 13:01:17,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:17,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:17,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash 240646324, now seen corresponding path program 1 times [2024-11-22 13:01:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058948683] [2024-11-22 13:01:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:17,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:17,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 13:01:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:17,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:17,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:18,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-22 13:01:18,373 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-11-22 13:01:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:18,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:18,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:18,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058948683] [2024-11-22 13:01:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058948683] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620847453] [2024-11-22 13:01:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:18,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:18,552 INFO L87 Difference]: Start difference. First operand 601 states and 789 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:18,670 INFO L93 Difference]: Finished difference Result 1377 states and 1788 transitions. [2024-11-22 13:01:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:18,673 INFO L225 Difference]: With dead ends: 1377 [2024-11-22 13:01:18,673 INFO L226 Difference]: Without dead ends: 779 [2024-11-22 13:01:18,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:18,675 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:18,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 558 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-22 13:01:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 613. [2024-11-22 13:01:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 545 states have (on average 1.2642201834862385) internal successors, (689), 549 states have internal predecessors, (689), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 13:01:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 801 transitions. [2024-11-22 13:01:18,692 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 801 transitions. Word has length 160 [2024-11-22 13:01:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:18,692 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 801 transitions. [2024-11-22 13:01:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 801 transitions. [2024-11-22 13:01:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 13:01:18,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:18,693 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:18,701 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 (15)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:18,894 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1039217354, now seen corresponding path program 1 times [2024-11-22 13:01:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825540069] [2024-11-22 13:01:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:18,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:18,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:18,896 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:18,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 13:01:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:19,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 13:01:19,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:19,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 13:01:19,957 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-11-22 13:01:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 13 proven. 443 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-22 13:01:19,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:20,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:20,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825540069] [2024-11-22 13:01:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825540069] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:20,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2024-11-22 13:01:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053636669] [2024-11-22 13:01:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:01:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:01:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-22 13:01:20,200 INFO L87 Difference]: Start difference. First operand 613 states and 801 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:20,398 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2024-11-22 13:01:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:01:20,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-22 13:01:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:20,401 INFO L225 Difference]: With dead ends: 1400 [2024-11-22 13:01:20,401 INFO L226 Difference]: Without dead ends: 790 [2024-11-22 13:01:20,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-11-22 13:01:20,404 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 58 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:20,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 910 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-22 13:01:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 707. [2024-11-22 13:01:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 627 states have (on average 1.2456140350877194) internal successors, (781), 633 states have internal predecessors, (781), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 909 transitions. [2024-11-22 13:01:20,425 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 909 transitions. Word has length 160 [2024-11-22 13:01:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 909 transitions. [2024-11-22 13:01:20,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 909 transitions. [2024-11-22 13:01:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:01:20,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:20,427 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:20,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 13:01:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:20,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1574974333, now seen corresponding path program 1 times [2024-11-22 13:01:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576879270] [2024-11-22 13:01:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:20,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:20,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:20,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 13:01:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:20,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 13:01:20,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:21,033 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 27 treesize of output 23 [2024-11-22 13:01:21,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-22 13:01:21,065 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 28 treesize of output 20 [2024-11-22 13:01:21,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 13:01:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-22 13:01:21,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:24,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:24,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576879270] [2024-11-22 13:01:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576879270] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:24,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2024-11-22 13:01:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246043650] [2024-11-22 13:01:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:01:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:01:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:24,140 INFO L87 Difference]: Start difference. First operand 707 states and 909 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:24,625 INFO L93 Difference]: Finished difference Result 1605 states and 2060 transitions. [2024-11-22 13:01:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:01:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:01:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:24,628 INFO L225 Difference]: With dead ends: 1605 [2024-11-22 13:01:24,629 INFO L226 Difference]: Without dead ends: 901 [2024-11-22 13:01:24,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-22 13:01:24,630 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 59 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:24,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1449 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:01:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-22 13:01:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 767. [2024-11-22 13:01:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 687 states have (on average 1.2532751091703056) internal successors, (861), 693 states have internal predecessors, (861), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 989 transitions. [2024-11-22 13:01:24,651 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 989 transitions. Word has length 162 [2024-11-22 13:01:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:24,651 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 989 transitions. [2024-11-22 13:01:24,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 989 transitions. [2024-11-22 13:01:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:01:24,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:24,652 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:24,661 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-11-22 13:01:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:24,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 295110655, now seen corresponding path program 1 times [2024-11-22 13:01:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580731217] [2024-11-22 13:01:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:24,855 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:24,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 13:01:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:25,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:25,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:25,852 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-11-22 13:01:25,862 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 29 treesize of output 17 [2024-11-22 13:01:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:25,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:26,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:26,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580731217] [2024-11-22 13:01:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580731217] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:26,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:26,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832846350] [2024-11-22 13:01:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:26,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:26,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:26,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:26,040 INFO L87 Difference]: Start difference. First operand 767 states and 989 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:26,164 INFO L93 Difference]: Finished difference Result 1690 states and 2165 transitions. [2024-11-22 13:01:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:01:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:26,167 INFO L225 Difference]: With dead ends: 1690 [2024-11-22 13:01:26,167 INFO L226 Difference]: Without dead ends: 926 [2024-11-22 13:01:26,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:26,169 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:26,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 503 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-22 13:01:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 767. [2024-11-22 13:01:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 687 states have (on average 1.2416302765647744) internal successors, (853), 693 states have internal predecessors, (853), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 981 transitions. [2024-11-22 13:01:26,189 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 981 transitions. Word has length 162 [2024-11-22 13:01:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:26,189 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 981 transitions. [2024-11-22 13:01:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 981 transitions. [2024-11-22 13:01:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:01:26,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:26,191 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:26,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:26,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1333789569, now seen corresponding path program 1 times [2024-11-22 13:01:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763101578] [2024-11-22 13:01:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:26,395 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:26,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 13:01:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:26,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 13:01:26,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:27,355 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-11-22 13:01:27,358 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 29 treesize of output 17 [2024-11-22 13:01:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 369 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-22 13:01:27,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:27,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763101578] [2024-11-22 13:01:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763101578] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:27,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:01:27,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-22 13:01:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258242627] [2024-11-22 13:01:27,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:01:27,536 INFO L87 Difference]: Start difference. First operand 767 states and 981 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:27,650 INFO L93 Difference]: Finished difference Result 1614 states and 2055 transitions. [2024-11-22 13:01:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:01:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:27,654 INFO L225 Difference]: With dead ends: 1614 [2024-11-22 13:01:27,654 INFO L226 Difference]: Without dead ends: 850 [2024-11-22 13:01:27,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:01:27,655 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 128 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:27,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 391 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-22 13:01:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 711. [2024-11-22 13:01:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 631 states have (on average 1.2345483359746434) internal successors, (779), 637 states have internal predecessors, (779), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 907 transitions. [2024-11-22 13:01:27,683 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 907 transitions. Word has length 162 [2024-11-22 13:01:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:27,683 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 907 transitions. [2024-11-22 13:01:27,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 907 transitions. [2024-11-22 13:01:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:01:27,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:27,685 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:27,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:27,886 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash -575637088, now seen corresponding path program 1 times [2024-11-22 13:01:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:27,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347374166] [2024-11-22 13:01:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:27,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:27,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 13:01:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:28,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:01:28,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:28,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:28,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347374166] [2024-11-22 13:01:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347374166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:01:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942411277] [2024-11-22 13:01:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:01:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:01:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:01:28,186 INFO L87 Difference]: Start difference. First operand 711 states and 907 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:28,221 INFO L93 Difference]: Finished difference Result 1443 states and 1843 transitions. [2024-11-22 13:01:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:01:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:01:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:28,224 INFO L225 Difference]: With dead ends: 1443 [2024-11-22 13:01:28,225 INFO L226 Difference]: Without dead ends: 735 [2024-11-22 13:01:28,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:01:28,227 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:28,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:01:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-22 13:01:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-22 13:01:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 655 states have (on average 1.2259541984732825) internal successors, (803), 661 states have internal predecessors, (803), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 931 transitions. [2024-11-22 13:01:28,248 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 931 transitions. Word has length 162 [2024-11-22 13:01:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:28,249 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 931 transitions. [2024-11-22 13:01:28,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 931 transitions. [2024-11-22 13:01:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 13:01:28,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:28,250 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:28,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 13:01:28,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:28,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:28,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash -38071043, now seen corresponding path program 1 times [2024-11-22 13:01:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428371557] [2024-11-22 13:01:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:28,452 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 13:01:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:28,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 13:01:28,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:28,790 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 27 treesize of output 23 [2024-11-22 13:01:28,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-22 13:01:28,831 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 28 treesize of output 20 [2024-11-22 13:01:28,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-22 13:01:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:28,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:28,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428371557] [2024-11-22 13:01:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428371557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 13:01:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993097931] [2024-11-22 13:01:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:28,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 13:01:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 13:01:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:01:28,962 INFO L87 Difference]: Start difference. First operand 735 states and 931 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:29,690 INFO L93 Difference]: Finished difference Result 1577 states and 1996 transitions. [2024-11-22 13:01:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:01:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-22 13:01:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:29,694 INFO L225 Difference]: With dead ends: 1577 [2024-11-22 13:01:29,694 INFO L226 Difference]: Without dead ends: 845 [2024-11-22 13:01:29,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:01:29,695 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 190 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:29,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1126 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:01:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-22 13:01:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 715. [2024-11-22 13:01:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 635 states have (on average 1.2299212598425198) internal successors, (781), 641 states have internal predecessors, (781), 64 states have call successors, (64), 15 states have call predecessors, (64), 15 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-22 13:01:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 909 transitions. [2024-11-22 13:01:29,727 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 909 transitions. Word has length 162 [2024-11-22 13:01:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:29,727 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 909 transitions. [2024-11-22 13:01:29,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 909 transitions. [2024-11-22 13:01:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:29,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:29,728 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:29,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 13:01:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:29,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:29,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash -710510343, now seen corresponding path program 1 times [2024-11-22 13:01:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:29,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321572795] [2024-11-22 13:01:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:29,935 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:29,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 13:01:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:30,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 13:01:30,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:01:31,196 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 125 treesize of output 89 [2024-11-22 13:01:31,198 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 137 treesize of output 77 [2024-11-22 13:01:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 13:01:31,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:31,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321572795] [2024-11-22 13:01:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321572795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [625026333] [2024-11-22 13:01:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:31,423 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:01:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:01:31,425 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:01:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-22 13:01:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:32,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 13:01:32,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:33,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:01:33,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:01:34,219 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 125 treesize of output 89 [2024-11-22 13:01:34,222 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 137 treesize of output 77 [2024-11-22 13:01:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 13:01:34,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [625026333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:34,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:01:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-22 13:01:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579715353] [2024-11-22 13:01:34,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:01:34,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 13:01:34,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 13:01:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:01:34,363 INFO L87 Difference]: Start difference. First operand 715 states and 909 transitions. Second operand has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 4 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-22 13:01:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:35,657 INFO L93 Difference]: Finished difference Result 1455 states and 1844 transitions. [2024-11-22 13:01:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:01:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 4 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 164 [2024-11-22 13:01:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:35,662 INFO L225 Difference]: With dead ends: 1455 [2024-11-22 13:01:35,662 INFO L226 Difference]: Without dead ends: 1453 [2024-11-22 13:01:35,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-22 13:01:35,663 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 210 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:35,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1610 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:01:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-22 13:01:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1449. [2024-11-22 13:01:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1288 states have (on average 1.2236024844720497) internal successors, (1576), 1302 states have internal predecessors, (1576), 128 states have call successors, (128), 32 states have call predecessors, (128), 32 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1832 transitions. [2024-11-22 13:01:35,732 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1832 transitions. Word has length 164 [2024-11-22 13:01:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:35,733 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1832 transitions. [2024-11-22 13:01:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 4 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-22 13:01:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1832 transitions. [2024-11-22 13:01:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:35,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:35,734 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:35,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:35,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-22 13:01:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:36,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -708663301, now seen corresponding path program 1 times [2024-11-22 13:01:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349121750] [2024-11-22 13:01:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:36,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:36,137 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:36,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-22 13:01:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:36,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:01:36,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:36,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 13:01:36,477 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-11-22 13:01:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:36,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:36,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349121750] [2024-11-22 13:01:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349121750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:01:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989187679] [2024-11-22 13:01:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:36,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:01:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:01:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:01:36,493 INFO L87 Difference]: Start difference. First operand 1449 states and 1832 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:36,750 INFO L93 Difference]: Finished difference Result 4389 states and 5554 transitions. [2024-11-22 13:01:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:01:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-22 13:01:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:36,759 INFO L225 Difference]: With dead ends: 4389 [2024-11-22 13:01:36,759 INFO L226 Difference]: Without dead ends: 2943 [2024-11-22 13:01:36,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 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-11-22 13:01:36,761 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 121 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:36,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 999 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:01:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2024-11-22 13:01:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2141. [2024-11-22 13:01:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 1980 states have (on average 1.2363636363636363) internal successors, (2448), 1994 states have internal predecessors, (2448), 128 states have call successors, (128), 32 states have call predecessors, (128), 32 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2704 transitions. [2024-11-22 13:01:36,859 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2704 transitions. Word has length 164 [2024-11-22 13:01:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:36,859 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 2704 transitions. [2024-11-22 13:01:36,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2704 transitions. [2024-11-22 13:01:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:36,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:36,862 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:36,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:37,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:37,062 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:37,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1518009927, now seen corresponding path program 1 times [2024-11-22 13:01:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:37,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99146616] [2024-11-22 13:01:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:37,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:37,064 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-22 13:01:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:37,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 13:01:37,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:37,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 13:01:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 420 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-22 13:01:37,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:37,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99146616] [2024-11-22 13:01:38,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99146616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602653145] [2024-11-22 13:01:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:38,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:01:38,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:01:38,001 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:01:38,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-22 13:01:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:38,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 13:01:38,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:38,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 13:01:39,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-22 13:01:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 427 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 13:01:39,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1602653145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:39,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:01:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2024-11-22 13:01:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208273325] [2024-11-22 13:01:39,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:01:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 13:01:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 13:01:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-22 13:01:39,799 INFO L87 Difference]: Start difference. First operand 2141 states and 2704 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 16 states have internal predecessors, (142), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-22 13:01:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:40,786 INFO L93 Difference]: Finished difference Result 4371 states and 5489 transitions. [2024-11-22 13:01:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 13:01:40,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 16 states have internal predecessors, (142), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 164 [2024-11-22 13:01:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:40,793 INFO L225 Difference]: With dead ends: 4371 [2024-11-22 13:01:40,793 INFO L226 Difference]: Without dead ends: 2233 [2024-11-22 13:01:40,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 13:01:40,796 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 354 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:40,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1136 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 13:01:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2024-11-22 13:01:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2173. [2024-11-22 13:01:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2004 states have (on average 1.217564870259481) internal successors, (2440), 2018 states have internal predecessors, (2440), 128 states have call successors, (128), 40 states have call predecessors, (128), 40 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 2696 transitions. [2024-11-22 13:01:40,905 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 2696 transitions. Word has length 164 [2024-11-22 13:01:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:40,905 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 2696 transitions. [2024-11-22 13:01:40,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 16 states have internal predecessors, (142), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-22 13:01:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2696 transitions. [2024-11-22 13:01:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:40,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:40,908 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:40,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:41,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:41,308 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1568833127, now seen corresponding path program 1 times [2024-11-22 13:01:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950094458] [2024-11-22 13:01:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:41,310 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-22 13:01:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:41,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:01:41,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:41,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 13:01:41,724 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-11-22 13:01:41,727 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 29 treesize of output 17 [2024-11-22 13:01:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:41,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:41,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950094458] [2024-11-22 13:01:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950094458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:01:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495716052] [2024-11-22 13:01:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:01:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:01:41,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:01:41,744 INFO L87 Difference]: Start difference. First operand 2173 states and 2696 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:42,419 INFO L93 Difference]: Finished difference Result 6265 states and 7673 transitions. [2024-11-22 13:01:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:01:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-22 13:01:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:42,430 INFO L225 Difference]: With dead ends: 6265 [2024-11-22 13:01:42,430 INFO L226 Difference]: Without dead ends: 4095 [2024-11-22 13:01:42,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 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-11-22 13:01:42,433 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 242 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:42,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1140 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 13:01:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2024-11-22 13:01:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2533. [2024-11-22 13:01:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2364 states have (on average 1.2030456852791878) internal successors, (2844), 2378 states have internal predecessors, (2844), 128 states have call successors, (128), 40 states have call predecessors, (128), 40 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3100 transitions. [2024-11-22 13:01:42,578 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3100 transitions. Word has length 164 [2024-11-22 13:01:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:42,580 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3100 transitions. [2024-11-22 13:01:42,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3100 transitions. [2024-11-22 13:01:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:42,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:42,582 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:42,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:42,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:42,783 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:42,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1214564733, now seen corresponding path program 1 times [2024-11-22 13:01:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035284114] [2024-11-22 13:01:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:42,786 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:42,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-22 13:01:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:43,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 13:01:43,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 13:01:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 420 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-22 13:01:43,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:43,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035284114] [2024-11-22 13:01:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035284114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [608112317] [2024-11-22 13:01:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:43,660 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:01:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:01:43,661 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:01:43,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-22 13:01:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:44,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 13:01:44,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:44,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:01:45,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-22 13:01:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 427 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 13:01:45,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [608112317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:45,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:01:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2024-11-22 13:01:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138932578] [2024-11-22 13:01:45,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:01:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 13:01:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 13:01:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-22 13:01:45,136 INFO L87 Difference]: Start difference. First operand 2533 states and 3100 transitions. Second operand has 20 states, 17 states have (on average 7.235294117647059) internal successors, (123), 16 states have internal predecessors, (123), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-22 13:01:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:46,848 INFO L93 Difference]: Finished difference Result 4431 states and 5385 transitions. [2024-11-22 13:01:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 13:01:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.235294117647059) internal successors, (123), 16 states have internal predecessors, (123), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 164 [2024-11-22 13:01:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:46,855 INFO L225 Difference]: With dead ends: 4431 [2024-11-22 13:01:46,857 INFO L226 Difference]: Without dead ends: 1901 [2024-11-22 13:01:46,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 13:01:46,860 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 406 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:46,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1121 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 13:01:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2024-11-22 13:01:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1841. [2024-11-22 13:01:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1672 states have (on average 1.1578947368421053) internal successors, (1936), 1686 states have internal predecessors, (1936), 128 states have call successors, (128), 40 states have call predecessors, (128), 40 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2192 transitions. [2024-11-22 13:01:46,988 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2192 transitions. Word has length 164 [2024-11-22 13:01:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2192 transitions. [2024-11-22 13:01:46,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.235294117647059) internal successors, (123), 16 states have internal predecessors, (123), 7 states have call successors, (40), 6 states have call predecessors, (40), 7 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-22 13:01:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2192 transitions. [2024-11-22 13:01:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 13:01:46,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:46,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:46,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:47,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:47,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:47,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:47,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash 182975995, now seen corresponding path program 1 times [2024-11-22 13:01:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458674938] [2024-11-22 13:01:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:47,394 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:47,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-22 13:01:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:47,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:01:47,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 13:01:47,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:47,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:47,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458674938] [2024-11-22 13:01:47,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458674938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:47,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:01:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909133773] [2024-11-22 13:01:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:01:47,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:01:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:01:47,665 INFO L87 Difference]: Start difference. First operand 1841 states and 2192 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:01:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:47,780 INFO L93 Difference]: Finished difference Result 3679 states and 4381 transitions. [2024-11-22 13:01:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:01:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2024-11-22 13:01:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:47,786 INFO L225 Difference]: With dead ends: 3679 [2024-11-22 13:01:47,786 INFO L226 Difference]: Without dead ends: 1841 [2024-11-22 13:01:47,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:01:47,793 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:47,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:01:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2024-11-22 13:01:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841. [2024-11-22 13:01:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1672 states have (on average 1.1566985645933014) internal successors, (1934), 1686 states have internal predecessors, (1934), 128 states have call successors, (128), 40 states have call predecessors, (128), 40 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2190 transitions. [2024-11-22 13:01:47,960 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2190 transitions. Word has length 164 [2024-11-22 13:01:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:47,960 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2190 transitions. [2024-11-22 13:01:47,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 13:01:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2190 transitions. [2024-11-22 13:01:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:01:47,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:47,962 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:47,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:48,163 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1159487160, now seen corresponding path program 1 times [2024-11-22 13:01:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902082228] [2024-11-22 13:01:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:48,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:48,165 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:48,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-22 13:01:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:48,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:01:48,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 13:01:48,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:01:48,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902082228] [2024-11-22 13:01:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902082228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:01:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:01:48,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:01:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718330329] [2024-11-22 13:01:48,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:01:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:01:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:01:48,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:01:48,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:01:48,543 INFO L87 Difference]: Start difference. First operand 1841 states and 2190 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:01:48,702 INFO L93 Difference]: Finished difference Result 3743 states and 4457 transitions. [2024-11-22 13:01:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:01:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-22 13:01:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:01:48,713 INFO L225 Difference]: With dead ends: 3743 [2024-11-22 13:01:48,713 INFO L226 Difference]: Without dead ends: 1905 [2024-11-22 13:01:48,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:01:48,716 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:01:48,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:01:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-11-22 13:01:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1857. [2024-11-22 13:01:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1688 states have (on average 1.15521327014218) internal successors, (1950), 1702 states have internal predecessors, (1950), 128 states have call successors, (128), 40 states have call predecessors, (128), 40 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 13:01:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2206 transitions. [2024-11-22 13:01:48,824 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2206 transitions. Word has length 165 [2024-11-22 13:01:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:01:48,825 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2206 transitions. [2024-11-22 13:01:48,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 13:01:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2206 transitions. [2024-11-22 13:01:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 13:01:48,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:01:48,826 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:01:48,837 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 (31)] Forceful destruction successful, exit code 0 [2024-11-22 13:01:49,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:01:49,027 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:01:49,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:01:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1860551738, now seen corresponding path program 1 times [2024-11-22 13:01:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:01:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654802632] [2024-11-22 13:01:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:49,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-11-22 13:01:49,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:01:49,029 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:01:49,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-22 13:01:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:01:49,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 13:01:49,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:01:51,429 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 28 treesize of output 16 [2024-11-22 13:01:51,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-22 13:01:51,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 13:01:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 617 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-22 13:01:51,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:01:53,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:01:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654802632] [2024-11-22 13:01:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654802632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:01:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [211606592] [2024-11-22 13:01:53,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:01:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:01:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:01:53,680 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:01:53,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process