./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-p_file-73.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 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:59:53,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:59:53,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:59:53,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:59:53,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:59:53,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:59:53,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:59:53,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:59:53,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:59:53,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:59:53,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:59:53,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:59:53,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:59:53,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:59:53,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:59:53,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:59:53,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:59:53,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:59:53,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:59:53,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:59:53,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:59:53,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:59:53,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:59:53,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:59:53,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:59:53,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:59:53,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:59:53,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:59:53,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:59:53,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:59:53,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:59:53,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:59:53,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:59:53,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:59:53,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:59:53,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:59:53,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:59:53,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:59:53,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:59:53,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:59:53,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:59:53,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:59:53,529 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 -> 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a [2024-11-19 00:59:53,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:59:53,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:59:53,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:59:53,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:59:53,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:59:53,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 00:59:54,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:59:55,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:59:55,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 00:59:55,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3422015a/95dc857ed92343bd82d5cc5762718cf8/FLAG88cc9543a [2024-11-19 00:59:55,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3422015a/95dc857ed92343bd82d5cc5762718cf8 [2024-11-19 00:59:55,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:59:55,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:59:55,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:59:55,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:59:55,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:59:55,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6dff44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55, skipping insertion in model container [2024-11-19 00:59:55,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:59:55,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2024-11-19 00:59:55,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:59:55,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:59:55,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2024-11-19 00:59:55,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:59:55,765 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:59:55,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55 WrapperNode [2024-11-19 00:59:55,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:59:55,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:59:55,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:59:55,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:59:55,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,812 INFO L138 Inliner]: procedures = 29, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-19 00:59:55,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:59:55,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:59:55,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:59:55,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:59:55,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,849 INFO L175 MemorySlicer]: Split 134 memory accesses to 15 slices as follows [2, 5, 10, 12, 17, 14, 12, 10, 12, 6, 6, 10, 3, 6, 9]. 13 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 00:59:55,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:59:55,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:59:55,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:59:55,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:59:55,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (1/1) ... [2024-11-19 00:59:55,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:59:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:55,953 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-19 00:59:55,958 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-19 00:59:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:59:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:59:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:59:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:59:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:59:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:59:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:59:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-19 00:59:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:59:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:59:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:59:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:59:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:59:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:59:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:59:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:59:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 00:59:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-19 00:59:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:59:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:59:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-19 00:59:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:59:56,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:59:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:59:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:59:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 00:59:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 00:59:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:59:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:59:56,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:59:56,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:59:56,583 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-19 00:59:56,584 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:59:56,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:59:56,595 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:59:56,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:59:56 BoogieIcfgContainer [2024-11-19 00:59:56,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:59:56,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:59:56,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:59:56,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:59:56,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:59:55" (1/3) ... [2024-11-19 00:59:56,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63664de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:59:56, skipping insertion in model container [2024-11-19 00:59:56,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:59:55" (2/3) ... [2024-11-19 00:59:56,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63664de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:59:56, skipping insertion in model container [2024-11-19 00:59:56,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:59:56" (3/3) ... [2024-11-19 00:59:56,602 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 00:59:56,615 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:59:56,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:59:56,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:59:56,671 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;@2469c720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:59:56,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:59:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:59:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:59:56,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:56,686 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:56,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-19 00:59:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55169878] [2024-11-19 00:59:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:59:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55169878] [2024-11-19 00:59:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55169878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:59:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398456162] [2024-11-19 00:59:56,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:56,966 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-19 00:59:56,967 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-19 00:59:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:57,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:59:57,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:59:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:59:57,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:59:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398456162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:59:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:59:57,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047815149] [2024-11-19 00:59:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:59:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:59:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:59:57,278 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:59:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:57,332 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-19 00:59:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:59:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 00:59:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:57,358 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:59:57,358 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:59:57,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-19 00:59:57,367 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 00:59:57,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:59:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 00:59:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:59:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 00:59:57,410 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-19 00:59:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 00:59:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:59:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 00:59:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:59:57,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:57,418 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:57,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:59:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:59:57,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:57,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-19 00:59:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:57,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622957833] [2024-11-19 00:59:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:59:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622957833] [2024-11-19 00:59:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622957833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:57,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:57,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:59:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623150118] [2024-11-19 00:59:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:57,835 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:59:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:57,861 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-19 00:59:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 00:59:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:57,863 INFO L225 Difference]: With dead ends: 211 [2024-11-19 00:59:57,863 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:59:57,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:59:57,865 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 00:59:57,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:59:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 00:59:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:59:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 00:59:57,880 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-19 00:59:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:57,881 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 00:59:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:59:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 00:59:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:59:57,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:57,883 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:57,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:59:57,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:57,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-19 00:59:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631602582] [2024-11-19 00:59:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:59:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631602582] [2024-11-19 00:59:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631602582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:59:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826687288] [2024-11-19 00:59:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:58,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:58,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:58,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:59:58,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:59:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:58,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:59:58,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:59:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:59:58,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:59:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826687288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:59:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 00:59:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006280936] [2024-11-19 00:59:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:58,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:58,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:58,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:58,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:59:58,402 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:58,438 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-19 00:59:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 00:59:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:58,441 INFO L225 Difference]: With dead ends: 216 [2024-11-19 00:59:58,441 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:59:58,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 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-19 00:59:58,444 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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-19 00:59:58,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:59:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-19 00:59:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:59:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-19 00:59:58,452 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-19 00:59:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:58,454 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-19 00:59:58,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-19 00:59:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:59:58,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:58,459 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:58,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:59:58,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:59:58,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1830600757, now seen corresponding path program 1 times [2024-11-19 00:59:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:58,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236682599] [2024-11-19 00:59:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:59:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236682599] [2024-11-19 00:59:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236682599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:59:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224896477] [2024-11-19 00:59:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:59:58,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:59:58,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:59:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:59,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:59:59,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:59:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:59:59,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:59:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224896477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:59,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:59:59,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:59:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473436591] [2024-11-19 00:59:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:59,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:59:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:59:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:59:59,065 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:59,091 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-19 00:59:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:59:59,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 00:59:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:59,093 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:59:59,096 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:59:59,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:59:59,097 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 00:59:59,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:59:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:59:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 00:59:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:59:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 00:59:59,108 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 129 [2024-11-19 00:59:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:59,108 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 00:59:59,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 00:59:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:59:59,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:59,111 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:59,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:59:59,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:59:59,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 227786598, now seen corresponding path program 1 times [2024-11-19 00:59:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466360371] [2024-11-19 00:59:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:59:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:59:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:59:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466360371] [2024-11-19 00:59:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466360371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:59:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:59:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:59:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518935230] [2024-11-19 00:59:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:59:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:59:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:59:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:59:59,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:59:59,673 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:59:59,788 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2024-11-19 00:59:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:59:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-19 00:59:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:59:59,791 INFO L225 Difference]: With dead ends: 332 [2024-11-19 00:59:59,791 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 00:59:59,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:59:59,793 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 103 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:59:59,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 497 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:59:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 00:59:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2024-11-19 00:59:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:59:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 314 transitions. [2024-11-19 00:59:59,815 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 314 transitions. Word has length 131 [2024-11-19 00:59:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:59:59,815 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 314 transitions. [2024-11-19 00:59:59,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:59:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 314 transitions. [2024-11-19 00:59:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:59:59,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:59:59,817 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:59:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:59:59,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:59:59,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:59:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash 650488424, now seen corresponding path program 1 times [2024-11-19 00:59:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:59:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117526136] [2024-11-19 00:59:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:59:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:59:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:00:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117526136] [2024-11-19 01:00:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117526136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:00:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605301444] [2024-11-19 01:00:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:00,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:00:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:00:00,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:00:00,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:00:00,321 INFO L87 Difference]: Start difference. First operand 217 states and 314 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:00,583 INFO L93 Difference]: Finished difference Result 538 states and 776 transitions. [2024-11-19 01:00:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:00:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-19 01:00:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:00,586 INFO L225 Difference]: With dead ends: 538 [2024-11-19 01:00:00,586 INFO L226 Difference]: Without dead ends: 324 [2024-11-19 01:00:00,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:00:00,587 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 308 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:00,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 928 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:00:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-19 01:00:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 221. [2024-11-19 01:00:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 188 states have (on average 1.377659574468085) internal successors, (259), 188 states have internal predecessors, (259), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 319 transitions. [2024-11-19 01:00:00,607 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 319 transitions. Word has length 131 [2024-11-19 01:00:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:00,608 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 319 transitions. [2024-11-19 01:00:00,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2024-11-19 01:00:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:00:00,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:00,610 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:00,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:00:00,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:00,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1671556778, now seen corresponding path program 1 times [2024-11-19 01:00:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:00:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489485319] [2024-11-19 01:00:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:00:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:00:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489485319] [2024-11-19 01:00:01,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489485319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:01,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:00:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676809532] [2024-11-19 01:00:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:00:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:00:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:00:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:00:01,006 INFO L87 Difference]: Start difference. First operand 221 states and 319 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:01,249 INFO L93 Difference]: Finished difference Result 502 states and 725 transitions. [2024-11-19 01:00:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:00:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-19 01:00:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:01,251 INFO L225 Difference]: With dead ends: 502 [2024-11-19 01:00:01,251 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 01:00:01,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:00:01,252 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 185 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:01,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 985 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:00:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 01:00:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 215. [2024-11-19 01:00:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2024-11-19 01:00:01,261 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 131 [2024-11-19 01:00:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:01,261 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2024-11-19 01:00:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2024-11-19 01:00:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:01,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:01,263 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:00:01,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:01,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1709832058, now seen corresponding path program 1 times [2024-11-19 01:00:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:00:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447318883] [2024-11-19 01:00:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:00:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:00:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447318883] [2024-11-19 01:00:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447318883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806911859] [2024-11-19 01:00:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:01,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:00:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:01,483 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:01,528 INFO L93 Difference]: Finished difference Result 377 states and 544 transitions. [2024-11-19 01:00:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:01,530 INFO L225 Difference]: With dead ends: 377 [2024-11-19 01:00:01,531 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 01:00:01,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:01,531 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:01,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 615 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:00:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 01:00:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2024-11-19 01:00:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.3959390862944163) internal successors, (275), 197 states have internal predecessors, (275), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2024-11-19 01:00:01,544 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 132 [2024-11-19 01:00:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:01,544 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2024-11-19 01:00:01,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2024-11-19 01:00:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:01,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:01,546 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:01,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:00:01,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 698714808, now seen corresponding path program 1 times [2024-11-19 01:00:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:00:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032505498] [2024-11-19 01:00:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:00:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:00:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032505498] [2024-11-19 01:00:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032505498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:01,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979601658] [2024-11-19 01:00:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:01,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:00:01,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:01,834 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:01,965 INFO L93 Difference]: Finished difference Result 519 states and 756 transitions. [2024-11-19 01:00:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:01,968 INFO L225 Difference]: With dead ends: 519 [2024-11-19 01:00:01,968 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 01:00:01,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:01,970 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 147 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:01,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 688 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:00:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 01:00:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 230. [2024-11-19 01:00:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.380710659898477) internal successors, (272), 197 states have internal predecessors, (272), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2024-11-19 01:00:01,985 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 132 [2024-11-19 01:00:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:01,986 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2024-11-19 01:00:01,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2024-11-19 01:00:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:01,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:01,987 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:00:01,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1121416634, now seen corresponding path program 1 times [2024-11-19 01:00:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:00:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139160785] [2024-11-19 01:00:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:00:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:00:02,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139160785] [2024-11-19 01:00:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139160785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:00:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362231551] [2024-11-19 01:00:02,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:02,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:00:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:00:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:00:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:00:02,383 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:02,772 INFO L93 Difference]: Finished difference Result 524 states and 757 transitions. [2024-11-19 01:00:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:00:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:02,775 INFO L225 Difference]: With dead ends: 524 [2024-11-19 01:00:02,775 INFO L226 Difference]: Without dead ends: 400 [2024-11-19 01:00:02,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:00:02,778 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 230 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:02,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1158 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:00:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-19 01:00:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 230. [2024-11-19 01:00:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 197 states have (on average 1.3756345177664975) internal successors, (271), 197 states have internal predecessors, (271), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 331 transitions. [2024-11-19 01:00:02,797 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 331 transitions. Word has length 132 [2024-11-19 01:00:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:02,798 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 331 transitions. [2024-11-19 01:00:02,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 331 transitions. [2024-11-19 01:00:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:02,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:02,799 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:00:02,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1876441692, now seen corresponding path program 1 times [2024-11-19 01:00:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:00:02,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995079382] [2024-11-19 01:00:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:00:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:00:02,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:00:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:00:03,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:00:03,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:00:03,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:00:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:00:03,025 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:00:03,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:00:03,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:00:03 BoogieIcfgContainer [2024-11-19 01:00:03,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:00:03,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:00:03,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:00:03,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:00:03,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:59:56" (3/4) ... [2024-11-19 01:00:03,176 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:00:03,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:00:03,177 INFO L158 Benchmark]: Toolchain (without parser) took 7712.19ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 82.8MB in the beginning and 187.4MB in the end (delta: -104.6MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,178 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:00:03,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.71ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 66.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.73ms. Allocated memory is still 155.2MB. Free memory was 66.6MB in the beginning and 62.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,178 INFO L158 Benchmark]: Boogie Preprocessor took 80.45ms. Allocated memory is still 155.2MB. Free memory was 62.7MB in the beginning and 57.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,179 INFO L158 Benchmark]: RCFGBuilder took 701.64ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 56.8MB in the beginning and 132.5MB in the end (delta: -75.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,179 INFO L158 Benchmark]: TraceAbstraction took 6575.54ms. Allocated memory was 207.6MB in the beginning and 299.9MB in the end (delta: 92.3MB). Free memory was 132.5MB in the beginning and 187.4MB in the end (delta: -54.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-19 01:00:03,179 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 299.9MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:00:03,180 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.10ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.71ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 66.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.73ms. Allocated memory is still 155.2MB. Free memory was 66.6MB in the beginning and 62.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.45ms. Allocated memory is still 155.2MB. Free memory was 62.7MB in the beginning and 57.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 701.64ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 56.8MB in the beginning and 132.5MB in the end (delta: -75.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6575.54ms. Allocated memory was 207.6MB in the beginning and 299.9MB in the end (delta: 92.3MB). Free memory was 132.5MB in the beginning and 187.4MB in the end (delta: -54.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 299.9MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L22] double var_1_1 = 5.5; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_6 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char* var_1_6_Pointer = &(var_1_6); [L26] double var_1_7 = -0.41; [L26] double var_1_7 = -0.41; [L27] double* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 25; [L28] unsigned char var_1_8 = 25; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 100; [L30] unsigned char var_1_9 = 100; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 1; [L32] unsigned char var_1_10 = 1; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] float var_1_12 = 15.75; [L34] float var_1_12 = 15.75; [L35] float* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 1.6; [L36] float var_1_13 = 1.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_14 = 0; [L38] unsigned char var_1_14 = 0; [L39] unsigned char* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 0; [L40] unsigned char var_1_15 = 0; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 16.5; [L42] float var_1_16 = 16.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] signed char var_1_17 = 10; [L44] signed char var_1_17 = 10; [L45] signed char* var_1_17_Pointer = &(var_1_17); [L46] signed char var_1_18 = -10; [L46] signed char var_1_18 = -10; [L47] signed char* var_1_18_Pointer = &(var_1_18); [L48] signed long int var_1_19 = -16; [L48] signed long int var_1_19 = -16; [L49] signed long int* var_1_19_Pointer = &(var_1_19); [L50] float last_1_var_1_12 = 15.75; VAL [isInitial=0, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR \read(var_1_12) [L112] last_1_var_1_12 = var_1_12 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L86] var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_7) [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F [L90] EXPR \read(var_1_7) [L90] EXPR var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] var_1_10 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] var_1_14 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] var_1_15 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L105] var_1_16 = __VERIFIER_nondet_float() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L108] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L108] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L109] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L123] RET updateVariables() [L124] CALL step() [L54] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] COND FALSE !((*(var_1_6_Pointer))) [L57] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L57] COND FALSE !(last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) [L61] EXPR \read(*var_1_8_Pointer) [L61] (*(var_1_19_Pointer)) = (*(var_1_8_Pointer)) [L62] EXPR \read(*var_1_19_Pointer) [L62] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L62] COND FALSE !((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) [L73] EXPR \read(*var_1_13_Pointer) [L73] (*(var_1_12_Pointer)) = (*(var_1_13_Pointer)) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) [L75] EXPR \read(*var_1_8_Pointer) [L75] EXPR \read(*var_1_19_Pointer) [L75] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] signed long int stepLocal_0 = ((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))); [L76] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] COND TRUE (*(var_1_8_Pointer)) <= stepLocal_0 [L77] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] COND TRUE ! (*(var_1_6_Pointer)) [L78] EXPR \read(*var_1_7_Pointer) [L78] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L83] EXPR \read(*var_1_18_Pointer) [L83] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR (((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1 [L115] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_7_Pointer) [L115] EXPR (! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR (((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115] EXPR ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L115-L116] return ((((((*(var_1_8_Pointer)) <= (((((*(var_1_8_Pointer))) > (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))) ? ((*(var_1_8_Pointer))) : (((*(var_1_8_Pointer)) + (*(var_1_19_Pointer))))))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_7_Pointer))))) : 1) && ((*(var_1_6_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : ((last_1_var_1_12 < (last_1_var_1_12 + (*(var_1_7_Pointer)))) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1))) && (((*(var_1_19_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(var_1_14_Pointer)) && (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) - (*(var_1_16_Pointer))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) (*(var_1_13_Pointer)))))) && ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_6={5:0}, var_1_6_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1035 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1035 mSDsluCounter, 6367 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4597 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1279 IncrementalHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 1770 mSDtfsCounter, 1279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 449 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 3111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1718 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 5348/5460 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-19 01:00:03,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-p_file-73.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 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:00:05,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:00:05,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:00:05,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:00:05,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:00:05,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:00:05,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:00:05,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:00:05,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:00:05,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:00:05,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:00:05,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:00:05,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:00:05,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:00:05,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:00:05,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:00:05,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:00:05,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:00:05,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:00:05,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:00:05,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:00:05,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:00:05,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:00:05,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:00:05,118 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:00:05,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:00:05,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:00:05,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:00:05,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:00:05,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:00:05,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:00:05,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:00:05,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:00:05,120 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:00:05,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:00:05,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:00:05,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:00:05,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:00:05,121 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 -> 10872b27050d1c9de943185207c4e069622b8a8d5facac060c22d86c3112029a [2024-11-19 01:00:05,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:00:05,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:00:05,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:00:05,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:00:05,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:00:05,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 01:00:06,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:00:06,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:00:06,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 01:00:06,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c55d4905/13ac864eeeaa4453bafbb71b6893bb0d/FLAG859758a55 [2024-11-19 01:00:07,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c55d4905/13ac864eeeaa4453bafbb71b6893bb0d [2024-11-19 01:00:07,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:00:07,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:00:07,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:00:07,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:00:07,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:00:07,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a40813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07, skipping insertion in model container [2024-11-19 01:00:07,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:00:07,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2024-11-19 01:00:07,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:00:07,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:00:07,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-73.i[916,929] [2024-11-19 01:00:07,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:00:07,580 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:00:07,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07 WrapperNode [2024-11-19 01:00:07,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:00:07,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:00:07,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:00:07,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:00:07,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,634 INFO L138 Inliner]: procedures = 36, calls = 174, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2024-11-19 01:00:07,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:00:07,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:00:07,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:00:07,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:00:07,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,697 INFO L175 MemorySlicer]: Split 134 memory accesses to 15 slices as follows [2, 5, 10, 12, 17, 14, 12, 10, 12, 6, 6, 10, 3, 6, 9]. 13 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 01:00:07,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:00:07,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:00:07,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:00:07,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:00:07,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (1/1) ... [2024-11-19 01:00:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:00:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:00:07,791 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-19 01:00:07,798 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-19 01:00:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:00:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:00:07,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:00:07,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 01:00:07,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 01:00:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 01:00:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 01:00:07,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-19 01:00:07,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:00:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:00:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 01:00:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 01:00:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 01:00:07,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 01:00:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 01:00:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 01:00:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 01:00:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 01:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 01:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-19 01:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 01:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 01:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 01:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 01:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 01:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 01:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 01:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 01:00:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 01:00:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 01:00:07,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 01:00:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 01:00:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 01:00:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:00:07,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:00:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:00:07,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:00:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:00:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:00:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 01:00:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 01:00:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-19 01:00:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-19 01:00:08,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:00:08,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:00:09,775 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-19 01:00:09,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:00:09,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:00:09,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:00:09,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:00:09 BoogieIcfgContainer [2024-11-19 01:00:09,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:00:09,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:00:09,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:00:09,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:00:09,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:00:07" (1/3) ... [2024-11-19 01:00:09,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6618f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:00:09, skipping insertion in model container [2024-11-19 01:00:09,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:00:07" (2/3) ... [2024-11-19 01:00:09,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6618f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:00:09, skipping insertion in model container [2024-11-19 01:00:09,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:00:09" (3/3) ... [2024-11-19 01:00:09,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-73.i [2024-11-19 01:00:09,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:00:09,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:00:09,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:00:09,880 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;@61f825ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:00:09,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:00:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:00:09,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:09,904 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:09,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:09,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-19 01:00:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676981981] [2024-11-19 01:00:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:09,920 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-19 01:00:09,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:09,923 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-19 01:00:09,942 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-19 01:00:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:10,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:00:10,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 01:00:10,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:10,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:10,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676981981] [2024-11-19 01:00:10,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676981981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:10,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:00:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048331319] [2024-11-19 01:00:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:00:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:00:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:00:10,413 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:10,437 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-19 01:00:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:00:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 01:00:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:10,449 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:00:10,450 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:00:10,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:00:10,457 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 01:00:10,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:00:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:00:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 01:00:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 01:00:10,495 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-19 01:00:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:10,495 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 01:00:10,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 01:00:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:00:10,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:10,497 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:10,507 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-19 01:00:10,698 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-19 01:00:10,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:10,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-19 01:00:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:10,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561800768] [2024-11-19 01:00:10,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:10,700 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-19 01:00:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:10,702 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-19 01:00:10,703 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-19 01:00:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:11,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:00:11,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-19 01:00:11,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:11,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561800768] [2024-11-19 01:00:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561800768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:00:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053662765] [2024-11-19 01:00:11,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:00:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:00:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:00:11,071 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:11,137 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-19 01:00:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:00:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 01:00:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:11,139 INFO L225 Difference]: With dead ends: 211 [2024-11-19 01:00:11,139 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 01:00:11,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-19 01:00:11,140 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 01:00:11,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:00:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 01:00:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 01:00:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 01:00:11,153 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-19 01:00:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 01:00:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 01:00:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:00:11,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:11,158 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:11,172 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-19 01:00:11,358 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-19 01:00:11,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:11,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-19 01:00:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159115363] [2024-11-19 01:00:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:11,361 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-19 01:00:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:11,362 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-19 01:00:11,363 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-19 01:00:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:11,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:00:11,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:12,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:12,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 01:00:12,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-19 01:00:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:12,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:12,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159115363] [2024-11-19 01:00:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159115363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:00:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291777558] [2024-11-19 01:00:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:12,189 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:13,038 INFO L93 Difference]: Finished difference Result 379 states and 553 transitions. [2024-11-19 01:00:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:13,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 01:00:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:13,042 INFO L225 Difference]: With dead ends: 379 [2024-11-19 01:00:13,042 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 01:00:13,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:13,045 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 168 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:13,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 696 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:00:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 01:00:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 207. [2024-11-19 01:00:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.396551724137931) internal successors, (243), 174 states have internal predecessors, (243), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 303 transitions. [2024-11-19 01:00:13,071 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 303 transitions. Word has length 129 [2024-11-19 01:00:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:13,071 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 303 transitions. [2024-11-19 01:00:13,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 303 transitions. [2024-11-19 01:00:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:00:13,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:13,073 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:13,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 01:00:13,273 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-19 01:00:13,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -999584565, now seen corresponding path program 1 times [2024-11-19 01:00:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994883024] [2024-11-19 01:00:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:13,275 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-19 01:00:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:13,278 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-19 01:00:13,279 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-19 01:00:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:13,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 01:00:13,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:13,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:13,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-19 01:00:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-19 01:00:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:13,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:13,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:13,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994883024] [2024-11-19 01:00:13,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994883024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:13,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:13,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:13,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494216631] [2024-11-19 01:00:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:13,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:00:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:00:13,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:13,927 INFO L87 Difference]: Start difference. First operand 207 states and 303 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:14,849 INFO L93 Difference]: Finished difference Result 478 states and 698 transitions. [2024-11-19 01:00:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:00:14,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 01:00:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:14,852 INFO L225 Difference]: With dead ends: 478 [2024-11-19 01:00:14,852 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 01:00:14,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:00:14,857 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 227 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:14,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 897 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:00:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 01:00:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 207. [2024-11-19 01:00:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.3908045977011494) internal successors, (242), 174 states have internal predecessors, (242), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 302 transitions. [2024-11-19 01:00:14,879 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 302 transitions. Word has length 129 [2024-11-19 01:00:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:14,879 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 302 transitions. [2024-11-19 01:00:14,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 302 transitions. [2024-11-19 01:00:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 01:00:14,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:14,881 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:14,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 01:00:15,084 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-19 01:00:15,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2013006243, now seen corresponding path program 1 times [2024-11-19 01:00:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276438373] [2024-11-19 01:00:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:15,086 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-19 01:00:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:15,090 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-19 01:00:15,091 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-19 01:00:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:15,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:00:15,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:15,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:15,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276438373] [2024-11-19 01:00:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276438373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:00:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288167444] [2024-11-19 01:00:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:00:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:00:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:00:15,398 INFO L87 Difference]: Start difference. First operand 207 states and 302 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:15,423 INFO L93 Difference]: Finished difference Result 415 states and 607 transitions. [2024-11-19 01:00:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:00:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-19 01:00:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:15,427 INFO L225 Difference]: With dead ends: 415 [2024-11-19 01:00:15,427 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 01:00:15,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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-19 01:00:15,429 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-19 01:00:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:00:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 01:00:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-19 01:00:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 178 states have internal predecessors, (246), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 306 transitions. [2024-11-19 01:00:15,444 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 306 transitions. Word has length 130 [2024-11-19 01:00:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:15,445 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 306 transitions. [2024-11-19 01:00:15,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 306 transitions. [2024-11-19 01:00:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:15,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:15,449 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:15,457 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-19 01:00:15,649 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-19 01:00:15,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -65175304, now seen corresponding path program 1 times [2024-11-19 01:00:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938912393] [2024-11-19 01:00:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:15,651 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-19 01:00:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:15,652 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-19 01:00:15,653 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-19 01:00:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:15,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:00:15,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:16,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 01:00:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 01:00:16,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:16,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938912393] [2024-11-19 01:00:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938912393] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:00:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:00:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-19 01:00:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419962934] [2024-11-19 01:00:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:00:16,444 INFO L87 Difference]: Start difference. First operand 211 states and 306 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:16,522 INFO L93 Difference]: Finished difference Result 369 states and 535 transitions. [2024-11-19 01:00:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:16,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:16,525 INFO L225 Difference]: With dead ends: 369 [2024-11-19 01:00:16,525 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 01:00:16,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:00:16,527 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 122 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:16,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 456 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:00:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 01:00:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2024-11-19 01:00:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.3989637305699483) internal successors, (270), 193 states have internal predecessors, (270), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2024-11-19 01:00:16,541 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 132 [2024-11-19 01:00:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:16,541 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2024-11-19 01:00:16,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2024-11-19 01:00:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:16,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:16,542 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:16,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 01:00:16,743 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-19 01:00:16,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1076292554, now seen corresponding path program 1 times [2024-11-19 01:00:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467858035] [2024-11-19 01:00:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:16,745 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-19 01:00:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:16,746 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-19 01:00:16,748 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-19 01:00:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:17,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:00:17,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:17,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:17,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467858035] [2024-11-19 01:00:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467858035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790625538] [2024-11-19 01:00:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:17,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:17,048 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:17,092 INFO L93 Difference]: Finished difference Result 459 states and 671 transitions. [2024-11-19 01:00:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:17,095 INFO L225 Difference]: With dead ends: 459 [2024-11-19 01:00:17,095 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 01:00:17,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-19 01:00:17,096 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:17,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:00:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 01:00:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-11-19 01:00:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 201 states have internal predecessors, (278), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2024-11-19 01:00:17,109 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 132 [2024-11-19 01:00:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:17,109 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2024-11-19 01:00:17,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2024-11-19 01:00:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:17,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:17,111 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:17,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:00:17,311 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-19 01:00:17,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:17,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 698714808, now seen corresponding path program 1 times [2024-11-19 01:00:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461693027] [2024-11-19 01:00:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:17,313 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-19 01:00:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:17,314 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-19 01:00:17,315 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-19 01:00:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:17,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:00:17,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:17,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:17,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 01:00:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 01:00:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:17,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:17,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461693027] [2024-11-19 01:00:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461693027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:00:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871297851] [2024-11-19 01:00:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:00:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:00:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:00:17,644 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:18,361 INFO L93 Difference]: Finished difference Result 422 states and 611 transitions. [2024-11-19 01:00:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:00:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:18,364 INFO L225 Difference]: With dead ends: 422 [2024-11-19 01:00:18,364 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 01:00:18,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:18,364 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 147 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:18,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 537 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:00:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 01:00:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 234. [2024-11-19 01:00:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 201 states have (on average 1.373134328358209) internal successors, (276), 201 states have internal predecessors, (276), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2024-11-19 01:00:18,381 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 132 [2024-11-19 01:00:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2024-11-19 01:00:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2024-11-19 01:00:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:18,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:18,382 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:18,392 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-19 01:00:18,583 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-19 01:00:18,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1121416634, now seen corresponding path program 1 times [2024-11-19 01:00:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249581410] [2024-11-19 01:00:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:18,585 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-19 01:00:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:18,586 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-19 01:00:18,587 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-19 01:00:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:18,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 01:00:18,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:19,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 01:00:19,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 01:00:19,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:19,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-19 01:00:19,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-19 01:00:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 01:00:19,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:19,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249581410] [2024-11-19 01:00:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249581410] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:00:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:00:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 01:00:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411762228] [2024-11-19 01:00:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:19,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:00:19,345 INFO L87 Difference]: Start difference. First operand 234 states and 336 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:19,858 INFO L93 Difference]: Finished difference Result 422 states and 607 transitions. [2024-11-19 01:00:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:00:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:19,861 INFO L225 Difference]: With dead ends: 422 [2024-11-19 01:00:19,861 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 01:00:19,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:00:19,862 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 145 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:19,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 722 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:00:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 01:00:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 129. [2024-11-19 01:00:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 112 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-11-19 01:00:19,871 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 132 [2024-11-19 01:00:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:19,872 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-11-19 01:00:19,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-11-19 01:00:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:00:19,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:19,874 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:19,885 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-19 01:00:20,074 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-19 01:00:20,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1876441692, now seen corresponding path program 1 times [2024-11-19 01:00:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69750161] [2024-11-19 01:00:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:20,076 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-19 01:00:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:20,077 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-19 01:00:20,079 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-19 01:00:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:20,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:00:20,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:20,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-19 01:00:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 01:00:20,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:20,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69750161] [2024-11-19 01:00:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69750161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813897493] [2024-11-19 01:00:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:20,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:00:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:00:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:20,597 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:22,990 INFO L93 Difference]: Finished difference Result 256 states and 364 transitions. [2024-11-19 01:00:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:00:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-19 01:00:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:22,997 INFO L225 Difference]: With dead ends: 256 [2024-11-19 01:00:22,997 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 01:00:22,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:00:22,998 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 121 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:22,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 01:00:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 01:00:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-19 01:00:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2024-11-19 01:00:23,006 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 132 [2024-11-19 01:00:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:23,006 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2024-11-19 01:00:23,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2024-11-19 01:00:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:00:23,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:23,008 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:23,022 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-19 01:00:23,208 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-19 01:00:23,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -658754018, now seen corresponding path program 1 times [2024-11-19 01:00:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8023230] [2024-11-19 01:00:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:23,210 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-19 01:00:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:23,211 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-19 01:00:23,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 01:00:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:23,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:00:23,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:23,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-19 01:00:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 01:00:23,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:23,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8023230] [2024-11-19 01:00:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8023230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:23,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079456085] [2024-11-19 01:00:23,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:23,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:00:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:00:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:23,695 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:25,294 INFO L93 Difference]: Finished difference Result 256 states and 362 transitions. [2024-11-19 01:00:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:00:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-19 01:00:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:25,297 INFO L225 Difference]: With dead ends: 256 [2024-11-19 01:00:25,297 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 01:00:25,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:00:25,298 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 100 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:25,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 479 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 01:00:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 01:00:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-19 01:00:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:00:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-19 01:00:25,305 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 134 [2024-11-19 01:00:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:25,305 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-19 01:00:25,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:00:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-19 01:00:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:00:25,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:25,306 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:25,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 01:00:25,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:00:25,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:25,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1514434148, now seen corresponding path program 1 times [2024-11-19 01:00:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655885846] [2024-11-19 01:00:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:25,509 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-19 01:00:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:25,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:00:25,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 01:00:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:26,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 01:00:26,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 01:00:27,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:27,161 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 203 treesize of output 133 [2024-11-19 01:00:27,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:27,168 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 288 treesize of output 138 [2024-11-19 01:00:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-19 01:00:27,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:27,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655885846] [2024-11-19 01:00:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655885846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:00:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20658188] [2024-11-19 01:00:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:00:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:00:27,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:00:27,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-19 01:00:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:28,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 01:00:28,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 01:00:31,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 01:00:32,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:32,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2024-11-19 01:00:32,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 146 [2024-11-19 01:00:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-19 01:00:32,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [20658188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:00:32,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:00:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-19 01:00:32,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169647603] [2024-11-19 01:00:32,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:00:32,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 01:00:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 01:00:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:00:32,310 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-19 01:00:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:38,803 INFO L93 Difference]: Finished difference Result 382 states and 536 transitions. [2024-11-19 01:00:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:00:38,807 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 136 [2024-11-19 01:00:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:38,809 INFO L225 Difference]: With dead ends: 382 [2024-11-19 01:00:38,809 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 01:00:38,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2024-11-19 01:00:38,810 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 288 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:38,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1777 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-19 01:00:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 01:00:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2024-11-19 01:00:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 216 states have internal predecessors, (288), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 01:00:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 352 transitions. [2024-11-19 01:00:38,832 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 352 transitions. Word has length 136 [2024-11-19 01:00:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 352 transitions. [2024-11-19 01:00:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-19 01:00:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 352 transitions. [2024-11-19 01:00:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:00:38,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:38,834 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:38,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-19 01:00:39,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 01:00:39,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:00:39,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:39,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1081826860, now seen corresponding path program 1 times [2024-11-19 01:00:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122420164] [2024-11-19 01:00:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:39,236 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-19 01:00:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:39,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:00:39,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 01:00:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:39,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:00:39,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:39,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:39,733 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 157 treesize of output 67 [2024-11-19 01:00:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 01:00:39,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:39,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:39,941 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 101 treesize of output 1 [2024-11-19 01:00:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 01:00:39,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122420164] [2024-11-19 01:00:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122420164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:00:39,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:00:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 01:00:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737363707] [2024-11-19 01:00:39,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:00:39,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:00:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:00:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:00:39,949 INFO L87 Difference]: Start difference. First operand 250 states and 352 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-19 01:00:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:42,890 INFO L93 Difference]: Finished difference Result 514 states and 717 transitions. [2024-11-19 01:00:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 01:00:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 138 [2024-11-19 01:00:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:42,894 INFO L225 Difference]: With dead ends: 514 [2024-11-19 01:00:42,894 INFO L226 Difference]: Without dead ends: 261 [2024-11-19 01:00:42,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-11-19 01:00:42,895 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 155 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:42,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 807 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 01:00:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-19 01:00:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2024-11-19 01:00:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 210 states have internal predecessors, (281), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:00:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 341 transitions. [2024-11-19 01:00:42,920 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 341 transitions. Word has length 138 [2024-11-19 01:00:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 341 transitions. [2024-11-19 01:00:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-19 01:00:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 341 transitions. [2024-11-19 01:00:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:00:42,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:42,923 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:42,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 01:00:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:00:43,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1297717152, now seen corresponding path program 1 times [2024-11-19 01:00:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:43,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551074802] [2024-11-19 01:00:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:43,125 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-19 01:00:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:43,127 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:00:43,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 01:00:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:43,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:00:43,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:43,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:43,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-19 01:00:43,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-19 01:00:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:43,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:43,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551074802] [2024-11-19 01:00:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551074802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:43,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:43,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:00:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023427882] [2024-11-19 01:00:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:00:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:00:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:43,703 INFO L87 Difference]: Start difference. First operand 243 states and 341 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:44,284 INFO L93 Difference]: Finished difference Result 806 states and 1130 transitions. [2024-11-19 01:00:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:00:44,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-19 01:00:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:44,286 INFO L225 Difference]: With dead ends: 806 [2024-11-19 01:00:44,287 INFO L226 Difference]: Without dead ends: 566 [2024-11-19 01:00:44,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:00:44,287 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 151 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:44,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 762 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:00:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-19 01:00:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 499. [2024-11-19 01:00:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 415 states have (on average 1.3156626506024096) internal successors, (546), 418 states have internal predecessors, (546), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-19 01:00:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 696 transitions. [2024-11-19 01:00:44,320 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 696 transitions. Word has length 138 [2024-11-19 01:00:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:44,321 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 696 transitions. [2024-11-19 01:00:44,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 696 transitions. [2024-11-19 01:00:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:00:44,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:44,322 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:44,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 01:00:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:00:44,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:44,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 696427554, now seen corresponding path program 1 times [2024-11-19 01:00:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635336077] [2024-11-19 01:00:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:44,524 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-19 01:00:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:44,525 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:00:44,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 01:00:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:44,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:00:44,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:45,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 01:00:45,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 01:00:45,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-19 01:00:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:00:45,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:00:45,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635336077] [2024-11-19 01:00:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635336077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:00:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:00:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:00:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625944427] [2024-11-19 01:00:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:00:45,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:00:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:00:45,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:00:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:00:45,111 INFO L87 Difference]: Start difference. First operand 499 states and 696 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:00:46,028 INFO L93 Difference]: Finished difference Result 1004 states and 1405 transitions. [2024-11-19 01:00:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:00:46,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-19 01:00:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:00:46,032 INFO L225 Difference]: With dead ends: 1004 [2024-11-19 01:00:46,032 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 01:00:46,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:00:46,034 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 202 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:00:46,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 692 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:00:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 01:00:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 495. [2024-11-19 01:00:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 411 states have (on average 1.3090024330900243) internal successors, (538), 414 states have internal predecessors, (538), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-19 01:00:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 688 transitions. [2024-11-19 01:00:46,075 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 688 transitions. Word has length 138 [2024-11-19 01:00:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:00:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 688 transitions. [2024-11-19 01:00:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:00:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 688 transitions. [2024-11-19 01:00:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 01:00:46,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:00:46,076 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:00:46,087 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 (17)] Ended with exit code 0 [2024-11-19 01:00:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:00:46,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:00:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:00:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash 593779754, now seen corresponding path program 1 times [2024-11-19 01:00:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:00:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112166810] [2024-11-19 01:00:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:46,279 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-19 01:00:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:00:46,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:00:46,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 01:00:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:46,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:00:46,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:46,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:00:48,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 01:00:48,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:48,270 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 203 treesize of output 133 [2024-11-19 01:00:48,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:00:48,276 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 286 treesize of output 136 [2024-11-19 01:00:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 01:00:48,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:00:48,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:00:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112166810] [2024-11-19 01:00:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112166810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:00:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135964865] [2024-11-19 01:00:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:00:48,694 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:00:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:00:48,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:00:48,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 01:00:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:00:50,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 01:00:50,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:00:50,536 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 47 treesize of output 23 [2024-11-19 01:00:50,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-19 01:01:15,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 01:01:28,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:01:28,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2024-11-19 01:01:28,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 156 [2024-11-19 01:01:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-19 01:01:28,998 INFO L311 TraceCheckSpWp]: Computing backward predicates...