./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:33:18,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:33:18,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:33:18,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:33:18,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:33:18,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:33:18,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:33:18,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:33:18,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:33:18,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:33:18,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:33:18,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:33:18,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:33:18,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:33:18,806 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:33:18,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:33:18,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:33:18,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:33:18,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:33:18,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:33:18,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:33:18,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:33:18,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:33:18,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:33:18,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:33:18,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:33:18,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:33:18,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:33:18,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:33:18,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:33:18,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:33:18,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:33:18,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:18,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:33:18,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:33:18,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:33:18,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:33:18,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:33:18,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:33:18,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:33:18,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:33:18,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:33:18,819 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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-09 01:33:19,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:33:19,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:33:19,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:33:19,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:33:19,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:33:19,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:20,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:33:20,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:33:20,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:20,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3dc92c7f/d387d90ee1be4b6babaf506ec27f96bc/FLAG272d61142 [2024-11-09 01:33:20,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3dc92c7f/d387d90ee1be4b6babaf506ec27f96bc [2024-11-09 01:33:20,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:33:20,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:33:20,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:20,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:33:20,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:33:20,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:20" (1/1) ... [2024-11-09 01:33:20,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7efdb76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:20, skipping insertion in model container [2024-11-09 01:33:20,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:20" (1/1) ... [2024-11-09 01:33:20,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:33:21,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-09 01:33:21,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:21,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:33:21,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-09 01:33:21,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:21,187 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:33:21,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21 WrapperNode [2024-11-09 01:33:21,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:21,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:21,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:33:21,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:33:21,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,288 INFO L138 Inliner]: procedures = 29, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 669 [2024-11-09 01:33:21,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:21,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:33:21,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:33:21,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:33:21,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,346 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-09 01:33:21,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:33:21,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:33:21,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:33:21,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:33:21,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (1/1) ... [2024-11-09 01:33:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:33:21,443 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-09 01:33:21,447 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-09 01:33:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:33:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:33:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:33:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:33:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:33:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:33:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:33:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:33:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:33:21,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:33:21,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:33:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:33:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:33:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:33:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:33:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:33:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:33:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:33:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:33:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:33:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:33:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:33:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:33:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:33:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:33:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:33:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:33:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:33:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:33:21,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:33:21,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:33:21,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:33:22,296 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-09 01:33:22,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:33:22,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:33:22,320 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:33:22,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:22 BoogieIcfgContainer [2024-11-09 01:33:22,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:33:22,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:33:22,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:33:22,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:33:22,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:33:20" (1/3) ... [2024-11-09 01:33:22,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac83089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:22, skipping insertion in model container [2024-11-09 01:33:22,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:21" (2/3) ... [2024-11-09 01:33:22,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac83089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:22, skipping insertion in model container [2024-11-09 01:33:22,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:22" (3/3) ... [2024-11-09 01:33:22,329 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:22,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:33:22,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:33:22,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:33:22,432 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;@1016a7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:33:22,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:33:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:22,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:22,454 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:22,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:22,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash -53766804, now seen corresponding path program 1 times [2024-11-09 01:33:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031839982] [2024-11-09 01:33:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:22,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031839982] [2024-11-09 01:33:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031839982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:33:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350349570] [2024-11-09 01:33:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:33:23,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:33:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:23,039 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:23,096 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 01:33:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:33:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:33:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:23,112 INFO L225 Difference]: With dead ends: 271 [2024-11-09 01:33:23,114 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:33:23,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-09 01:33:23,153 INFO L432 NwaCegarLoop]: 198 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, 198 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-09 01:33:23,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:33:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 01:33:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 01:33:23,220 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 01:33:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 01:33:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 01:33:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:23,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:23,230 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:23,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:33:23,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:23,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1541869432, now seen corresponding path program 1 times [2024-11-09 01:33:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952474] [2024-11-09 01:33:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679952474] [2024-11-09 01:33:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679952474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162576890] [2024-11-09 01:33:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:23,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:23,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:23,677 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:23,738 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 01:33:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:33:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:23,741 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:33:23,741 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 01:33:23,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-09 01:33:23,743 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:23,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 01:33:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 01:33:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 01:33:23,763 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 01:33:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:23,764 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 01:33:23,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 01:33:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:23,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:23,767 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:23,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:33:23,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:23,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 246000390, now seen corresponding path program 1 times [2024-11-09 01:33:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371019872] [2024-11-09 01:33:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371019872] [2024-11-09 01:33:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371019872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:24,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:24,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368061101] [2024-11-09 01:33:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:24,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:24,199 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:24,240 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-09 01:33:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:24,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 01:33:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:24,245 INFO L225 Difference]: With dead ends: 273 [2024-11-09 01:33:24,245 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 01:33:24,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-09 01:33:24,248 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:24,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 01:33:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 01:33:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-09 01:33:24,259 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-09 01:33:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-09 01:33:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-09 01:33:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:24,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:24,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:33:24,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -960375231, now seen corresponding path program 1 times [2024-11-09 01:33:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180425503] [2024-11-09 01:33:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:24,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180425503] [2024-11-09 01:33:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180425503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545103349] [2024-11-09 01:33:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:24,567 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:24,602 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-09 01:33:24,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:24,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:33:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:24,606 INFO L225 Difference]: With dead ends: 278 [2024-11-09 01:33:24,606 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 01:33:24,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-09 01:33:24,612 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:24,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 01:33:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-09 01:33:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-09 01:33:24,634 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-09 01:33:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:24,635 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-09 01:33:24,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-09 01:33:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:24,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:24,638 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:24,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:33:24,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:24,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1547181245, now seen corresponding path program 1 times [2024-11-09 01:33:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138093978] [2024-11-09 01:33:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138093978] [2024-11-09 01:33:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138093978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114325113] [2024-11-09 01:33:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:24,896 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:24,919 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-09 01:33:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:24,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:33:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:24,922 INFO L225 Difference]: With dead ends: 282 [2024-11-09 01:33:24,922 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 01:33:24,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-09 01:33:24,924 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:24,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 01:33:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 01:33:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-09 01:33:24,933 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-09 01:33:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:24,933 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-09 01:33:24,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-09 01:33:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:24,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:24,953 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:33:24,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -867122875, now seen corresponding path program 1 times [2024-11-09 01:33:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152095821] [2024-11-09 01:33:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152095821] [2024-11-09 01:33:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152095821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909420234] [2024-11-09 01:33:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:25,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:25,192 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:25,222 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-09 01:33:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:33:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:25,226 INFO L225 Difference]: With dead ends: 286 [2024-11-09 01:33:25,226 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 01:33:25,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-09 01:33:25,227 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:25,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 01:33:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-09 01:33:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-09 01:33:25,241 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-09 01:33:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:25,242 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-09 01:33:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-09 01:33:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:25,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:25,247 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:33:25,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:25,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash 907884487, now seen corresponding path program 1 times [2024-11-09 01:33:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488526618] [2024-11-09 01:33:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488526618] [2024-11-09 01:33:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488526618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:25,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057235905] [2024-11-09 01:33:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:25,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:25,441 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:25,463 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-09 01:33:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:33:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:25,465 INFO L225 Difference]: With dead ends: 290 [2024-11-09 01:33:25,465 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 01:33:25,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-09 01:33:25,466 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:25,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 01:33:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-09 01:33:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-09 01:33:25,472 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-09 01:33:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-09 01:33:25,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-09 01:33:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:25,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:25,475 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:25,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:33:25,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 909731529, now seen corresponding path program 1 times [2024-11-09 01:33:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679124446] [2024-11-09 01:33:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:33:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679124446] [2024-11-09 01:33:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679124446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889037624] [2024-11-09 01:33:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:26,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:26,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:33:26,423 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-09 01:33:26,424 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-09 01:33:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:26,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:33:26,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:27,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-09 01:33:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-09 01:33:27,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:33:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889037624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:33:27,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:33:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 01:33:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331143923] [2024-11-09 01:33:27,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:33:27,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:33:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:33:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:33:27,759 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 01:33:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:28,147 INFO L93 Difference]: Finished difference Result 299 states and 424 transitions. [2024-11-09 01:33:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:33:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-09 01:33:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:28,149 INFO L225 Difference]: With dead ends: 299 [2024-11-09 01:33:28,149 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 01:33:28,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:33:28,153 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 568 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:28,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 833 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 01:33:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-09 01:33:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-11-09 01:33:28,170 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 158 [2024-11-09 01:33:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-11-09 01:33:28,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 01:33:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-11-09 01:33:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:33:28,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:28,176 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:28,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:28,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:28,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1084413177, now seen corresponding path program 1 times [2024-11-09 01:33:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:28,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976161201] [2024-11-09 01:33:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976161201] [2024-11-09 01:33:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976161201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:29,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:33:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092154559] [2024-11-09 01:33:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:29,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:29,092 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:29,220 INFO L93 Difference]: Finished difference Result 445 states and 628 transitions. [2024-11-09 01:33:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:33:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:33:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:29,223 INFO L225 Difference]: With dead ends: 445 [2024-11-09 01:33:29,223 INFO L226 Difference]: Without dead ends: 297 [2024-11-09 01:33:29,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:33:29,225 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 128 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:29,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1097 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-09 01:33:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2024-11-09 01:33:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.36) internal successors, (340), 250 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:33:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 412 transitions. [2024-11-09 01:33:29,248 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 412 transitions. Word has length 158 [2024-11-09 01:33:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:29,248 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 412 transitions. [2024-11-09 01:33:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 412 transitions. [2024-11-09 01:33:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:33:29,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:29,251 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:29,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:33:29,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:29,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1753466944, now seen corresponding path program 1 times [2024-11-09 01:33:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:29,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915154637] [2024-11-09 01:33:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915154637] [2024-11-09 01:33:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915154637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:30,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:30,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824387060] [2024-11-09 01:33:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:30,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:30,077 INFO L87 Difference]: Start difference. First operand 291 states and 412 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:30,274 INFO L93 Difference]: Finished difference Result 651 states and 920 transitions. [2024-11-09 01:33:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-09 01:33:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:30,277 INFO L225 Difference]: With dead ends: 651 [2024-11-09 01:33:30,279 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 01:33:30,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:33:30,280 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 167 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:30,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 01:33:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 362. [2024-11-09 01:33:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 302 states have (on average 1.3377483443708609) internal successors, (404), 303 states have internal predecessors, (404), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:33:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions. [2024-11-09 01:33:30,320 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 160 [2024-11-09 01:33:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:30,323 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 508 transitions. [2024-11-09 01:33:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions. [2024-11-09 01:33:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:33:30,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:30,326 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:30,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:33:30,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:30,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1954694338, now seen corresponding path program 1 times [2024-11-09 01:33:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:30,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284925443] [2024-11-09 01:33:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:30,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284925443] [2024-11-09 01:33:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284925443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538485968] [2024-11-09 01:33:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:30,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:30,702 INFO L87 Difference]: Start difference. First operand 362 states and 508 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:30,973 INFO L93 Difference]: Finished difference Result 920 states and 1279 transitions. [2024-11-09 01:33:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:33:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:30,979 INFO L225 Difference]: With dead ends: 920 [2024-11-09 01:33:30,980 INFO L226 Difference]: Without dead ends: 620 [2024-11-09 01:33:30,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 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-09 01:33:30,981 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 144 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:30,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1137 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:33:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-09 01:33:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 502. [2024-11-09 01:33:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 421 states have (on average 1.327790973871734) internal successors, (559), 423 states have internal predecessors, (559), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 01:33:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 699 transitions. [2024-11-09 01:33:31,034 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 699 transitions. Word has length 160 [2024-11-09 01:33:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 699 transitions. [2024-11-09 01:33:31,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 699 transitions. [2024-11-09 01:33:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:33:31,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:31,037 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:31,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:33:31,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:31,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1193819284, now seen corresponding path program 1 times [2024-11-09 01:33:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108688987] [2024-11-09 01:33:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108688987] [2024-11-09 01:33:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108688987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:31,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721299140] [2024-11-09 01:33:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:31,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:33:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:33:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:33:31,857 INFO L87 Difference]: Start difference. First operand 502 states and 699 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:32,088 INFO L93 Difference]: Finished difference Result 830 states and 1152 transitions. [2024-11-09 01:33:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:32,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-09 01:33:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:32,093 INFO L225 Difference]: With dead ends: 830 [2024-11-09 01:33:32,093 INFO L226 Difference]: Without dead ends: 658 [2024-11-09 01:33:32,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:33:32,094 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 171 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:32,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1427 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-09 01:33:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 531. [2024-11-09 01:33:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 452 states have internal predecessors, (601), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 01:33:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 741 transitions. [2024-11-09 01:33:32,154 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 741 transitions. Word has length 160 [2024-11-09 01:33:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:32,154 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 741 transitions. [2024-11-09 01:33:32,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 741 transitions. [2024-11-09 01:33:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 01:33:32,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:32,156 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:33:32,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -492219410, now seen corresponding path program 1 times [2024-11-09 01:33:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620188689] [2024-11-09 01:33:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620188689] [2024-11-09 01:33:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620188689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:32,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:32,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:33:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479810164] [2024-11-09 01:33:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:33:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:33:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:33:32,792 INFO L87 Difference]: Start difference. First operand 531 states and 741 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:32,989 INFO L93 Difference]: Finished difference Result 899 states and 1252 transitions. [2024-11-09 01:33:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:33:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-09 01:33:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:32,994 INFO L225 Difference]: With dead ends: 899 [2024-11-09 01:33:32,994 INFO L226 Difference]: Without dead ends: 700 [2024-11-09 01:33:32,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:33:32,996 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 182 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:32,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1094 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-09 01:33:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 691. [2024-11-09 01:33:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 589 states have (on average 1.3378607809847198) internal successors, (788), 591 states have internal predecessors, (788), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:33:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 964 transitions. [2024-11-09 01:33:33,075 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 964 transitions. Word has length 160 [2024-11-09 01:33:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:33,076 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 964 transitions. [2024-11-09 01:33:33,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 964 transitions. [2024-11-09 01:33:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:33:33,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:33,078 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:33,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:33:33,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:33,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 314882053, now seen corresponding path program 1 times [2024-11-09 01:33:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:33,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230599038] [2024-11-09 01:33:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230599038] [2024-11-09 01:33:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230599038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:33:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674728943] [2024-11-09 01:33:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:34,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:34,010 INFO L87 Difference]: Start difference. First operand 691 states and 964 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:34,169 INFO L93 Difference]: Finished difference Result 705 states and 981 transitions. [2024-11-09 01:33:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-09 01:33:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:34,174 INFO L225 Difference]: With dead ends: 705 [2024-11-09 01:33:34,174 INFO L226 Difference]: Without dead ends: 703 [2024-11-09 01:33:34,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:33:34,175 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:34,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-09 01:33:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-09 01:33:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 601 states have (on average 1.3311148086522462) internal successors, (800), 603 states have internal predecessors, (800), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:33:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 976 transitions. [2024-11-09 01:33:34,240 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 976 transitions. Word has length 163 [2024-11-09 01:33:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:34,240 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 976 transitions. [2024-11-09 01:33:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 976 transitions. [2024-11-09 01:33:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:33:34,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:34,243 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:33:34,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash 316729095, now seen corresponding path program 1 times [2024-11-09 01:33:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798728407] [2024-11-09 01:33:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798728407] [2024-11-09 01:33:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798728407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739397125] [2024-11-09 01:33:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:34,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:34,590 INFO L87 Difference]: Start difference. First operand 703 states and 976 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:34,794 INFO L93 Difference]: Finished difference Result 1364 states and 1878 transitions. [2024-11-09 01:33:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:33:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:34,799 INFO L225 Difference]: With dead ends: 1364 [2024-11-09 01:33:34,800 INFO L226 Difference]: Without dead ends: 723 [2024-11-09 01:33:34,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:34,802 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:34,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 461 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-09 01:33:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-09 01:33:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 616 states have (on average 1.3165584415584415) internal successors, (811), 618 states have internal predecessors, (811), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:33:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 987 transitions. [2024-11-09 01:33:34,872 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 987 transitions. Word has length 163 [2024-11-09 01:33:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:34,872 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 987 transitions. [2024-11-09 01:33:34,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 987 transitions. [2024-11-09 01:33:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:33:34,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:34,876 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:33:34,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2091736457, now seen corresponding path program 1 times [2024-11-09 01:33:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053059577] [2024-11-09 01:33:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053059577] [2024-11-09 01:33:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053059577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668531284] [2024-11-09 01:33:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:35,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:35,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:35,141 INFO L87 Difference]: Start difference. First operand 723 states and 987 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:35,258 INFO L93 Difference]: Finished difference Result 1380 states and 1882 transitions. [2024-11-09 01:33:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:33:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:35,262 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 01:33:35,263 INFO L226 Difference]: Without dead ends: 723 [2024-11-09 01:33:35,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:35,265 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 167 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:35,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 554 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-09 01:33:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2024-11-09 01:33:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 616 states have (on average 1.3100649350649352) internal successors, (807), 618 states have internal predecessors, (807), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:33:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 983 transitions. [2024-11-09 01:33:35,339 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 983 transitions. Word has length 163 [2024-11-09 01:33:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:35,340 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 983 transitions. [2024-11-09 01:33:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 983 transitions. [2024-11-09 01:33:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 01:33:35,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:35,342 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:33:35,342 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1523172469, now seen corresponding path program 1 times [2024-11-09 01:33:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21738863] [2024-11-09 01:33:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:33:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:33:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:33:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:33:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:33:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:33:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:33:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:33:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:33:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:33:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:33:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:33:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:33:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:33:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:33:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:33:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:33:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:33:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:33:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:33:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21738863] [2024-11-09 01:33:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21738863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:33:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888331929] [2024-11-09 01:33:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:33:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:35,531 INFO L87 Difference]: Start difference. First operand 723 states and 983 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:35,637 INFO L93 Difference]: Finished difference Result 1392 states and 1890 transitions. [2024-11-09 01:33:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:33:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-09 01:33:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:35,642 INFO L225 Difference]: With dead ends: 1392 [2024-11-09 01:33:35,643 INFO L226 Difference]: Without dead ends: 735 [2024-11-09 01:33:35,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-09 01:33:35,645 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:35,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-09 01:33:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-09 01:33:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 628 states have (on average 1.3041401273885351) internal successors, (819), 630 states have internal predecessors, (819), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 01:33:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 995 transitions. [2024-11-09 01:33:35,717 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 995 transitions. Word has length 163 [2024-11-09 01:33:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:35,718 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 995 transitions. [2024-11-09 01:33:35,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:33:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 995 transitions. [2024-11-09 01:33:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 01:33:35,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:35,720 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:35,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:33:35,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1058859444, now seen corresponding path program 1 times [2024-11-09 01:33:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:33:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197503191] [2024-11-09 01:33:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:33:35,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:33:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:33:35,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:33:35,907 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:33:35,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:33:35,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:33:35,914 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:36,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:33:36,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:33:36 BoogieIcfgContainer [2024-11-09 01:33:36,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:33:36,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:33:36,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:33:36,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:33:36,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:22" (3/4) ... [2024-11-09 01:33:36,053 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:33:36,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:33:36,056 INFO L158 Benchmark]: Toolchain (without parser) took 15242.46ms. Allocated memory was 142.6MB in the beginning and 408.9MB in the end (delta: 266.3MB). Free memory was 72.4MB in the beginning and 245.3MB in the end (delta: -172.9MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,056 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:33:36,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.33ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 54.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.36ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 111.0MB in the end (delta: -56.4MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,057 INFO L158 Benchmark]: Boogie Preprocessor took 107.76ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 108.5MB in the end (delta: 2.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,058 INFO L158 Benchmark]: RCFGBuilder took 923.46ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 64.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,058 INFO L158 Benchmark]: TraceAbstraction took 13726.43ms. Allocated memory was 142.6MB in the beginning and 408.9MB in the end (delta: 266.3MB). Free memory was 63.7MB in the beginning and 246.4MB in the end (delta: -182.6MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,058 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 408.9MB. Free memory was 246.4MB in the beginning and 245.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:33:36,059 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.22ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.33ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 54.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.36ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 111.0MB in the end (delta: -56.4MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.76ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 108.5MB in the end (delta: 2.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * RCFGBuilder took 923.46ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 64.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13726.43ms. Allocated memory was 142.6MB in the beginning and 408.9MB in the end (delta: 266.3MB). Free memory was 63.7MB in the beginning and 246.4MB in the end (delta: -182.6MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 408.9MB. Free memory was 246.4MB in the beginning and 245.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L40] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR signed_short_int_Array_0[0] [L93] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] float_Array_0[0][0] = __VERIFIER_nondet_float() [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] float_Array_0[1][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] signed_char_Array_0[5] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] signed_char_Array_0[6] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L44] EXPR unsigned_long_int_Array_0[1] [L44] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L45] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ [L46] EXPR signed_char_Array_0[2] [L46] signed_char_Array_0[1] = signed_char_Array_0[2] [L47] EXPR BOOL_unsigned_char_Array_0[1] [L47] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND FALSE !(((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) [L51] EXPR signed_char_Array_0[1] [L51] signed char stepLocal_0 = signed_char_Array_0[1]; [L52] EXPR signed_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=20, unsigned_long_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) [L55] EXPR float_Array_0[1][0] [L55] EXPR float_Array_0[1][1] [L55] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L55] EXPR float_Array_0[1][1] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND TRUE float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] signed_long_int_Array_0[0] = (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][1] [L96] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) [L96] EXPR float_Array_0[1][0] [L96] EXPR float_Array_0[1][1] [L96] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) [L96] EXPR signed_long_int_Array_0[0] [L96] EXPR signed_char_Array_0[1] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96-L97] return (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1743 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1739 mSDsluCounter, 13178 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9648 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 3530 mSDtfsCounter, 1196 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 982 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=17, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 269 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3033 NumberOfCodeBlocks, 3033 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3005 ConstructedInterpolants, 0 QuantifiedInterpolants, 9741 SizeOfPredicates, 1 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 11484/11628 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-09 01:33:36,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:33:38,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:33:38,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:33:38,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:33:38,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:33:38,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:33:38,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:33:38,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:33:38,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:33:38,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:33:38,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:33:38,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:33:38,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:33:38,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:33:38,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:33:38,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:33:38,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:33:38,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:33:38,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:33:38,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:33:38,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:33:38,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:33:38,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:33:38,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:33:38,581 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:33:38,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:33:38,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:33:38,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:33:38,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:33:38,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:33:38,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:33:38,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:33:38,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:33:38,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:33:38,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:38,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:33:38,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:33:38,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:33:38,587 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:33:38,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:33:38,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:33:38,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:33:38,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:33:38,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:33:38,589 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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-09 01:33:38,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:33:38,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:33:38,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:33:38,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:33:38,967 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:33:38,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:40,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:33:40,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:33:40,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:40,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2d0aa2c/6954c3c57b4746368309f5390ab01ede/FLAG3a5dda033 [2024-11-09 01:33:41,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2d0aa2c/6954c3c57b4746368309f5390ab01ede [2024-11-09 01:33:41,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:33:41,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:33:41,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:41,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:33:41,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:33:41,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40654c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41, skipping insertion in model container [2024-11-09 01:33:41,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:33:41,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-09 01:33:41,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:41,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:33:41,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-09 01:33:41,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:33:41,636 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:33:41,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41 WrapperNode [2024-11-09 01:33:41,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:33:41,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:41,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:33:41,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:33:41,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,734 INFO L138 Inliner]: procedures = 36, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 664 [2024-11-09 01:33:41,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:33:41,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:33:41,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:33:41,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:33:41,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,796 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-09 01:33:41,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:33:41,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:33:41,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:33:41,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:33:41,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (1/1) ... [2024-11-09 01:33:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:33:41,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:33:41,896 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-09 01:33:41,899 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-09 01:33:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:33:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:33:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:33:41,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:33:41,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:33:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:33:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:33:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:33:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:33:41,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:33:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:33:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:33:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:33:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:33:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:33:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:33:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:33:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:33:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:33:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:33:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:33:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:33:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:33:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:33:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:33:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:33:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:33:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:33:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:33:42,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:33:42,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:33:44,776 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-09 01:33:44,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:33:44,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:33:44,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:33:44,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:44 BoogieIcfgContainer [2024-11-09 01:33:44,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:33:44,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:33:44,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:33:44,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:33:44,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:33:41" (1/3) ... [2024-11-09 01:33:44,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc8570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:44, skipping insertion in model container [2024-11-09 01:33:44,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:33:41" (2/3) ... [2024-11-09 01:33:44,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc8570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:33:44, skipping insertion in model container [2024-11-09 01:33:44,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:33:44" (3/3) ... [2024-11-09 01:33:44,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-09 01:33:44,827 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:33:44,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:33:44,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:33:44,898 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;@3db3637e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:33:44,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:33:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:44,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:44,919 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:44,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:44,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -53766804, now seen corresponding path program 1 times [2024-11-09 01:33:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:44,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931387583] [2024-11-09 01:33:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:44,939 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-09 01:33:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:44,941 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-09 01:33:44,943 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-09 01:33:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:45,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:33:45,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-09 01:33:45,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:45,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931387583] [2024-11-09 01:33:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931387583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:33:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376206909] [2024-11-09 01:33:45,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:45,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:33:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:33:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:33:45,648 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:45,680 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 01:33:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:33:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:33:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:45,690 INFO L225 Difference]: With dead ends: 271 [2024-11-09 01:33:45,690 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:33:45,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-09 01:33:45,696 INFO L432 NwaCegarLoop]: 198 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, 198 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-09 01:33:45,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:33:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:33:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 01:33:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 01:33:45,738 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 01:33:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:45,739 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 01:33:45,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 01:33:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:45,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:45,743 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:45,754 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-09 01:33:45,943 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-09 01:33:45,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:45,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1541869432, now seen corresponding path program 1 times [2024-11-09 01:33:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:45,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000092192] [2024-11-09 01:33:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:33:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:45,948 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-09 01:33:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:33:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:46,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:33:46,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-09 01:33:46,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:46,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000092192] [2024-11-09 01:33:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000092192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738880104] [2024-11-09 01:33:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:33:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:46,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:33:46,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:33:46,524 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:46,623 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 01:33:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:33:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:33:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:46,628 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:33:46,628 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 01:33:46,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-09 01:33:46,630 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:46,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:33:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 01:33:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 01:33:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 01:33:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 01:33:46,643 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 01:33:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:46,648 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 01:33:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 01:33:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:46,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:46,654 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:46,669 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-09 01:33:46,855 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-09 01:33:46,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 246000390, now seen corresponding path program 1 times [2024-11-09 01:33:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957438942] [2024-11-09 01:33:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:46,857 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-09 01:33:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:46,859 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-09 01:33:46,860 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-09 01:33:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:47,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:33:47,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:48,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-09 01:33:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-09 01:33:48,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:48,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957438942] [2024-11-09 01:33:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957438942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:48,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352038684] [2024-11-09 01:33:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:48,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:48,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:48,618 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:53,678 INFO L93 Difference]: Finished difference Result 402 states and 589 transitions. [2024-11-09 01:33:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:33:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:33:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:53,682 INFO L225 Difference]: With dead ends: 402 [2024-11-09 01:33:53,682 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 01:33:53,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:33:53,685 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 307 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:53,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 718 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 01:33:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 01:33:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-11-09 01:33:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 227 states have internal predecessors, (317), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:33:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 389 transitions. [2024-11-09 01:33:53,739 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 389 transitions. Word has length 156 [2024-11-09 01:33:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:53,739 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 389 transitions. [2024-11-09 01:33:53,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:33:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 389 transitions. [2024-11-09 01:33:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:33:53,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:53,749 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:33:53,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:33:53,950 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-09 01:33:53,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:33:53,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash 268632644, now seen corresponding path program 1 times [2024-11-09 01:33:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:33:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334088818] [2024-11-09 01:33:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:53,952 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-09 01:33:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:33:53,956 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-09 01:33:53,962 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-09 01:33:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:54,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:33:54,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:55,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-09 01:33:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-09 01:33:55,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:33:55,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:33:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334088818] [2024-11-09 01:33:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334088818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:55,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:33:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182554601] [2024-11-09 01:33:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:33:55,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:33:55,626 INFO L87 Difference]: Start difference. First operand 265 states and 389 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:34:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:01,282 INFO L93 Difference]: Finished difference Result 530 states and 777 transitions. [2024-11-09 01:34:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 01:34:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:01,285 INFO L225 Difference]: With dead ends: 530 [2024-11-09 01:34:01,286 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 01:34:01,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:34:01,289 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 385 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:01,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 716 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 01:34:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 01:34:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-11-09 01:34:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.3982300884955752) internal successors, (316), 227 states have internal predecessors, (316), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 388 transitions. [2024-11-09 01:34:01,314 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 388 transitions. Word has length 156 [2024-11-09 01:34:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:01,315 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 388 transitions. [2024-11-09 01:34:01,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 01:34:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 388 transitions. [2024-11-09 01:34:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 01:34:01,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:01,318 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:01,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:01,519 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-09 01:34:01,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1420311098, now seen corresponding path program 1 times [2024-11-09 01:34:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844035137] [2024-11-09 01:34:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:01,521 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-09 01:34:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:01,523 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-09 01:34:01,524 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-09 01:34:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:34:02,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:02,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:02,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:02,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844035137] [2024-11-09 01:34:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844035137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:02,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:02,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050153894] [2024-11-09 01:34:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:02,096 INFO L87 Difference]: Start difference. First operand 265 states and 388 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:02,137 INFO L93 Difference]: Finished difference Result 531 states and 779 transitions. [2024-11-09 01:34:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 01:34:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:02,146 INFO L225 Difference]: With dead ends: 531 [2024-11-09 01:34:02,147 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 01:34:02,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-09 01:34:02,149 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:02,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 01:34:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 01:34:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 230 states have (on average 1.391304347826087) internal successors, (320), 231 states have internal predecessors, (320), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 392 transitions. [2024-11-09 01:34:02,167 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 392 transitions. Word has length 156 [2024-11-09 01:34:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 392 transitions. [2024-11-09 01:34:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 392 transitions. [2024-11-09 01:34:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:02,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:02,170 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:02,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:34:02,370 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-09 01:34:02,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -262913791, now seen corresponding path program 1 times [2024-11-09 01:34:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476151908] [2024-11-09 01:34:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:02,372 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-09 01:34:02,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:02,373 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-09 01:34:02,374 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-09 01:34:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:02,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:34:02,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-09 01:34:03,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:03,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2024-11-09 01:34:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-09 01:34:03,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 01:34:03,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476151908] [2024-11-09 01:34:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476151908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:34:03,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:34:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-09 01:34:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124454425] [2024-11-09 01:34:03,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:34:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:34:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:34:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:34:03,953 INFO L87 Difference]: Start difference. First operand 269 states and 392 transitions. Second operand has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 01:34:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:05,480 INFO L93 Difference]: Finished difference Result 551 states and 795 transitions. [2024-11-09 01:34:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:34:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-09 01:34:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:05,485 INFO L225 Difference]: With dead ends: 551 [2024-11-09 01:34:05,485 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 01:34:05,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:34:05,487 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 300 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:05,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 834 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 01:34:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 01:34:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2024-11-09 01:34:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 236 states have (on average 1.3728813559322033) internal successors, (324), 237 states have internal predecessors, (324), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 396 transitions. [2024-11-09 01:34:05,516 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 396 transitions. Word has length 158 [2024-11-09 01:34:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:05,518 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 396 transitions. [2024-11-09 01:34:05,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 01:34:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 396 transitions. [2024-11-09 01:34:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:05,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:05,521 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:05,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:05,721 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-09 01:34:05,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:05,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2037908799, now seen corresponding path program 1 times [2024-11-09 01:34:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:05,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178789568] [2024-11-09 01:34:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:05,723 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-09 01:34:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:05,724 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-09 01:34:05,725 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-09 01:34:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:34:06,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:06,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:06,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178789568] [2024-11-09 01:34:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178789568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959442319] [2024-11-09 01:34:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:06,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:06,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:06,199 INFO L87 Difference]: Start difference. First operand 277 states and 396 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:06,250 INFO L93 Difference]: Finished difference Result 557 states and 797 transitions. [2024-11-09 01:34:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:06,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:34:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:06,253 INFO L225 Difference]: With dead ends: 557 [2024-11-09 01:34:06,253 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 01:34:06,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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-09 01:34:06,255 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:06,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:34:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 01:34:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2024-11-09 01:34:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 241 states have internal predecessors, (328), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2024-11-09 01:34:06,272 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 158 [2024-11-09 01:34:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:06,272 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2024-11-09 01:34:06,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2024-11-09 01:34:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:06,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:06,275 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:06,290 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-09 01:34:06,475 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-09 01:34:06,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:06,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1451102785, now seen corresponding path program 1 times [2024-11-09 01:34:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198051607] [2024-11-09 01:34:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:06,477 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-09 01:34:06,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:06,478 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-09 01:34:06,479 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-09 01:34:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:06,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:34:06,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:06,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:06,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198051607] [2024-11-09 01:34:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198051607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:34:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875749523] [2024-11-09 01:34:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:06,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:34:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:34:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:34:06,986 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:07,067 INFO L93 Difference]: Finished difference Result 569 states and 811 transitions. [2024-11-09 01:34:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:34:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:07,070 INFO L225 Difference]: With dead ends: 569 [2024-11-09 01:34:07,070 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 01:34:07,071 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-09 01:34:07,072 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:07,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:34:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 01:34:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-11-09 01:34:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 248 states have (on average 1.3548387096774193) internal successors, (336), 249 states have internal predecessors, (336), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 408 transitions. [2024-11-09 01:34:07,090 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 408 transitions. Word has length 158 [2024-11-09 01:34:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:07,091 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 408 transitions. [2024-11-09 01:34:07,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 408 transitions. [2024-11-09 01:34:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:07,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:07,093 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:07,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:34:07,293 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-09 01:34:07,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:07,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2131161155, now seen corresponding path program 1 times [2024-11-09 01:34:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449470991] [2024-11-09 01:34:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:07,295 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-09 01:34:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:07,297 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-09 01:34:07,297 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-09 01:34:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:07,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:34:07,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:07,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:07,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449470991] [2024-11-09 01:34:07,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449470991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:07,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:34:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977753433] [2024-11-09 01:34:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:07,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:34:07,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:34:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:07,781 INFO L87 Difference]: Start difference. First operand 289 states and 408 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:07,876 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2024-11-09 01:34:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:34:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:34:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:07,879 INFO L225 Difference]: With dead ends: 581 [2024-11-09 01:34:07,879 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 01:34:07,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:07,881 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:07,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:34:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 01:34:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2024-11-09 01:34:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 253 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2024-11-09 01:34:07,899 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 412 transitions. Word has length 158 [2024-11-09 01:34:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:07,900 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 412 transitions. [2024-11-09 01:34:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 412 transitions. [2024-11-09 01:34:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:07,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:07,902 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:07,922 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-09 01:34:08,102 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-09 01:34:08,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:08,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -388798779, now seen corresponding path program 1 times [2024-11-09 01:34:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138676599] [2024-11-09 01:34:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:08,104 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-09 01:34:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:08,105 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-09 01:34:08,108 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-09 01:34:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:08,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:34:08,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 01:34:08,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:08,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:34:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138676599] [2024-11-09 01:34:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138676599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:34:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973791425] [2024-11-09 01:34:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:34:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:34:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:34:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:08,590 INFO L87 Difference]: Start difference. First operand 293 states and 412 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:08,685 INFO L93 Difference]: Finished difference Result 589 states and 829 transitions. [2024-11-09 01:34:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:34:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 01:34:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:08,688 INFO L225 Difference]: With dead ends: 589 [2024-11-09 01:34:08,688 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 01:34:08,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:08,690 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:08,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1280 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:34:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 01:34:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2024-11-09 01:34:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 256 states have (on average 1.34375) internal successors, (344), 257 states have internal predecessors, (344), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 01:34:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2024-11-09 01:34:08,706 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 158 [2024-11-09 01:34:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:08,707 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2024-11-09 01:34:08,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 01:34:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2024-11-09 01:34:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 01:34:08,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:08,709 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:34:08,725 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-09 01:34:08,910 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-09 01:34:08,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:34:08,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash -386951737, now seen corresponding path program 1 times [2024-11-09 01:34:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:34:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747322028] [2024-11-09 01:34:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:08,911 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-09 01:34:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:34:08,912 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-09 01:34:08,914 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