./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:56:26,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:56:26,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:56:26,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:56:26,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:56:26,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:56:26,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:56:26,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:56:26,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:56:26,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:56:26,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:56:26,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:56:26,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:56:26,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:56:26,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:56:26,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:56:26,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:56:26,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:56:26,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:56:26,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:56:26,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:56:26,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:56:26,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:56:26,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:56:26,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:56:26,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:56:26,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:56:26,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:56:26,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:56:26,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:56:26,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:56:26,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:56:26,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:56:26,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:56:26,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:56:26,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:56:26,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:56:26,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:56:26,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:56:26,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:56:26,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:56:26,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:56:26,799 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2024-11-09 01:56:27,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:56:27,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:56:27,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:56:27,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:56:27,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:56:27,115 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-78.i [2024-11-09 01:56:28,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:56:28,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:56:28,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-09 01:56:28,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea491593/ae64aa48a9814a56bb5eaa36078a23f5/FLAGadb40116a [2024-11-09 01:56:28,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea491593/ae64aa48a9814a56bb5eaa36078a23f5 [2024-11-09 01:56:28,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:56:28,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:56:28,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:56:28,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:56:28,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:56:28,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:56:28" (1/1) ... [2024-11-09 01:56:28,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14641e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:28, skipping insertion in model container [2024-11-09 01:56:28,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:56:28" (1/1) ... [2024-11-09 01:56:28,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:56:29,078 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-78.i[916,929] [2024-11-09 01:56:29,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:56:29,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:56:29,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i[916,929] [2024-11-09 01:56:29,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:56:29,187 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:56:29,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29 WrapperNode [2024-11-09 01:56:29,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:56:29,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:56:29,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:56:29,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:56:29,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,254 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2024-11-09 01:56:29,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:56:29,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:56:29,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:56:29,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:56:29,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,318 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2024-11-09 01:56:29,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:56:29,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:56:29,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:56:29,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:56:29,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (1/1) ... [2024-11-09 01:56:29,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:56:29,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:56:29,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:56:29,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:56:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:56:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:56:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:56:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:56:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 01:56:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:56:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:56:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:56:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:56:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-09 01:56:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-09 01:56:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-09 01:56:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-09 01:56:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-09 01:56:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:56:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:56:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:56:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:56:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:56:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:56:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:56:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 01:56:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 01:56:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:56:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:56:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:56:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:56:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:56:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-09 01:56:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-09 01:56:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-09 01:56:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-09 01:56:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-09 01:56:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:56:29,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:56:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 01:56:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 01:56:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 01:56:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:56:29,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:56:29,661 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:56:29,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:56:30,159 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-09 01:56:30,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:56:30,173 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:56:30,174 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:56:30,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:56:30 BoogieIcfgContainer [2024-11-09 01:56:30,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:56:30,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:56:30,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:56:30,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:56:30,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:56:28" (1/3) ... [2024-11-09 01:56:30,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36adbaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:56:30, skipping insertion in model container [2024-11-09 01:56:30,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:29" (2/3) ... [2024-11-09 01:56:30,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36adbaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:56:30, skipping insertion in model container [2024-11-09 01:56:30,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:56:30" (3/3) ... [2024-11-09 01:56:30,184 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2024-11-09 01:56:30,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:56:30,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:56:30,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:56:30,274 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;@345971f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:56:30,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:56:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:30,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:30,292 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:30,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:30,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-09 01:56:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903777976] [2024-11-09 01:56:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:56:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:56:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:56:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:56:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:56:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:56:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:56:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:56:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:56:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:56:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:56:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903777976] [2024-11-09 01:56:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903777976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:56:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558798808] [2024-11-09 01:56:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:30,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:56:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:56:30,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:56:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:56:30,764 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:30,803 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-09 01:56:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:56:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-09 01:56:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:30,819 INFO L225 Difference]: With dead ends: 179 [2024-11-09 01:56:30,820 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:56:30,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:56:30,831 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:30,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:56:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:56:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-09 01:56:30,875 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-09 01:56:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:30,876 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-09 01:56:30,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-09 01:56:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:30,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:30,882 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:56:30,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-09 01:56:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563160938] [2024-11-09 01:56:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:56:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:56:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:56:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:56:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:56:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:56:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:56:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:56:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:56:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:56:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:56:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563160938] [2024-11-09 01:56:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563160938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:31,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:56:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789428709] [2024-11-09 01:56:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:56:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:31,209 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:31,251 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-09 01:56:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-09 01:56:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:31,253 INFO L225 Difference]: With dead ends: 177 [2024-11-09 01:56:31,254 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:56:31,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:31,256 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:31,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:56:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:56:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-09 01:56:31,267 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-09 01:56:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-09 01:56:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-09 01:56:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:31,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:31,274 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:31,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:56:31,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-09 01:56:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383945844] [2024-11-09 01:56:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:56:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:56:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:56:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:56:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:56:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:56:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:56:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:56:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:56:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:56:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:56:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383945844] [2024-11-09 01:56:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383945844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:56:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087616616] [2024-11-09 01:56:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:31,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:56:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:31,681 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:31,723 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-09 01:56:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:31,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-09 01:56:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:31,726 INFO L225 Difference]: With dead ends: 181 [2024-11-09 01:56:31,728 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 01:56:31,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:31,730 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:31,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 01:56:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 01:56:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-09 01:56:31,747 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2024-11-09 01:56:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:31,747 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-09 01:56:31,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-09 01:56:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:56:31,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:31,752 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:31,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:56:31,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:31,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -561605494, now seen corresponding path program 1 times [2024-11-09 01:56:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:31,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705137547] [2024-11-09 01:56:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:31,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:56:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:56:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:56:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:56:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:56:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:56:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:56:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:56:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:56:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:56:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:56:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705137547] [2024-11-09 01:56:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705137547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:32,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:56:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785480036] [2024-11-09 01:56:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:32,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:56:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:32,208 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:32,289 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2024-11-09 01:56:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:32,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2024-11-09 01:56:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:32,294 INFO L225 Difference]: With dead ends: 273 [2024-11-09 01:56:32,294 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 01:56:32,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-09 01:56:32,298 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:32,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 01:56:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-09 01:56:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2024-11-09 01:56:32,329 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 100 [2024-11-09 01:56:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:32,330 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2024-11-09 01:56:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2024-11-09 01:56:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:56:32,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:32,333 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:56:32,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1582673848, now seen corresponding path program 1 times [2024-11-09 01:56:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344783805] [2024-11-09 01:56:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:56:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:56:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:56:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:56:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:56:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:56:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:56:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:56:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:56:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:56:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:56:32,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344783805] [2024-11-09 01:56:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344783805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:32,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:32,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:56:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999527333] [2024-11-09 01:56:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:32,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:56:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:56:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:56:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:56:32,798 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:32,881 INFO L93 Difference]: Finished difference Result 415 states and 596 transitions. [2024-11-09 01:56:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:56:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2024-11-09 01:56:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:32,883 INFO L225 Difference]: With dead ends: 415 [2024-11-09 01:56:32,883 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 01:56:32,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:56:32,885 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 37 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:32,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 635 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:56:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 01:56:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2024-11-09 01:56:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.4) internal successors, (245), 175 states have internal predecessors, (245), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2024-11-09 01:56:32,899 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 100 [2024-11-09 01:56:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2024-11-09 01:56:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2024-11-09 01:56:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:56:32,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:32,901 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:32,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:56:32,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:32,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-09 01:56:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:56:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819721483] [2024-11-09 01:56:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:56:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:56:32,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:56:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:56:33,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:56:33,109 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:56:33,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:56:33,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:56:33,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 01:56:33,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:56:33,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:56:33 BoogieIcfgContainer [2024-11-09 01:56:33,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:56:33,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:56:33,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:56:33,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:56:33,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:56:30" (3/4) ... [2024-11-09 01:56:33,291 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:56:33,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:56:33,293 INFO L158 Benchmark]: Toolchain (without parser) took 4445.14ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 90.8MB in the beginning and 105.7MB in the end (delta: -14.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,294 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:56:33,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 144.7MB. Free memory was 90.8MB in the beginning and 75.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.49ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 71.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,296 INFO L158 Benchmark]: Boogie Preprocessor took 112.03ms. Allocated memory is still 144.7MB. Free memory was 71.4MB in the beginning and 66.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,296 INFO L158 Benchmark]: RCFGBuilder took 805.93ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 66.6MB in the beginning and 169.4MB in the end (delta: -102.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,297 INFO L158 Benchmark]: TraceAbstraction took 3111.09ms. Allocated memory is still 207.6MB. Free memory was 168.4MB in the beginning and 105.7MB in the end (delta: 62.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-11-09 01:56:33,297 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 207.6MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:56:33,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 144.7MB. Free memory was 90.8MB in the beginning and 75.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.49ms. Allocated memory is still 144.7MB. Free memory was 75.0MB in the beginning and 71.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.03ms. Allocated memory is still 144.7MB. Free memory was 71.4MB in the beginning and 66.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 805.93ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 66.6MB in the beginning and 169.4MB in the end (delta: -102.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3111.09ms. Allocated memory is still 207.6MB. Free memory was 168.4MB in the beginning and 105.7MB in the end (delta: 62.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 207.6MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L22] signed long int var_1_1 = -200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] float var_1_9 = 100.55; [L28] float var_1_9 = 100.55; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 4.75; [L30] float var_1_10 = 4.75; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] float var_1_11 = 128.75; [L32] float var_1_11 = 128.75; [L33] float* var_1_11_Pointer = &(var_1_11); [L34] double var_1_12 = 128.5; [L34] double var_1_12 = 128.5; [L35] double* var_1_12_Pointer = &(var_1_12); [L36] double var_1_13 = 0.0; [L36] double var_1_13 = 0.0; [L37] double* var_1_13_Pointer = &(var_1_13); [L38] double var_1_14 = 127.875; [L38] double var_1_14 = 127.875; [L39] double* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 1; [L40] unsigned char var_1_15 = 1; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 16; [L42] unsigned char var_1_16 = 16; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L76] var_1_2 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_11 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET updateVariables() [L106] CALL step() [L47] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L47] COND TRUE 0.8f > (- (*(var_1_10_Pointer))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_15_Pointer) [L50] EXPR \read(*var_1_15_Pointer) [L50] unsigned char stepLocal_1 = (*(var_1_15_Pointer)) > (*(var_1_15_Pointer)); [L51] EXPR \read(*var_1_3_Pointer) [L51] unsigned char stepLocal_0 = (*(var_1_3_Pointer)); [L52] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L52] COND FALSE !((*(var_1_2_Pointer)) && stepLocal_0) [L59] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] COND TRUE (*(var_1_2_Pointer)) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_9_Pointer)) = ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] signed long int stepLocal_2 = (*(var_1_1_Pointer)); [L69] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_11_Pointer) [L72] (*(var_1_12_Pointer)) = (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_2_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) [L97] EXPR \read(*var_1_3_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) [L97] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR \read(*var_1_11_Pointer) [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97-L98] return (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_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_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 1859 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 643 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=5, InterpolantAutomatonStates: 20, 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, 5 MinimizatonAttempts, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:56:33,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:56:35,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:56:35,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:56:35,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:56:35,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:56:35,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:56:35,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:56:35,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:56:35,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:56:35,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:56:35,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:56:35,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:56:35,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:56:35,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:56:35,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:56:35,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:56:35,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:56:35,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:56:35,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:56:35,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:56:35,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:56:35,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:56:35,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:56:35,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:56:35,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:56:35,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:56:35,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:56:35,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:56:35,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:56:35,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:56:35,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:56:35,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:56:35,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:56:35,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:56:35,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:56:35,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:56:35,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:56:35,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:56:35,714 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:56:35,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:56:35,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:56:35,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:56:35,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:56:35,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:56:35,716 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2024-11-09 01:56:36,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:56:36,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:56:36,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:56:36,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:56:36,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:56:36,072 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-78.i [2024-11-09 01:56:37,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:56:37,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:56:37,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-09 01:56:37,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac4befa7/d7c3b8db5b324c588a0b1b35f6174dfd/FLAG8b49872a4 [2024-11-09 01:56:38,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac4befa7/d7c3b8db5b324c588a0b1b35f6174dfd [2024-11-09 01:56:38,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:56:38,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:56:38,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:56:38,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:56:38,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:56:38,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf8d72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38, skipping insertion in model container [2024-11-09 01:56:38,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:56:38,470 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-78.i[916,929] [2024-11-09 01:56:38,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:56:38,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:56:38,582 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-78.i[916,929] [2024-11-09 01:56:38,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:56:38,639 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:56:38,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38 WrapperNode [2024-11-09 01:56:38,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:56:38,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:56:38,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:56:38,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:56:38,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,712 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2024-11-09 01:56:38,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:56:38,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:56:38,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:56:38,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:56:38,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,779 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2024-11-09 01:56:38,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:56:38,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:56:38,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:56:38,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:56:38,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (1/1) ... [2024-11-09 01:56:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:56:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:56:38,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:56:38,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:56:38,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:56:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:56:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:56:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:56:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:56:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:56:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:56:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-09 01:56:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:56:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:56:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-09 01:56:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-09 01:56:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-09 01:56:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-09 01:56:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-09 01:56:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:56:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:56:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:56:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:56:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:56:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:56:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 01:56:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 01:56:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:56:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:56:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:56:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:56:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:56:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:56:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 01:56:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 01:56:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 01:56:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 01:56:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 01:56:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 01:56:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:56:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:56:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:56:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:56:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:56:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-09 01:56:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-09 01:56:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-09 01:56:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-09 01:56:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-09 01:56:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-09 01:56:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-09 01:56:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:56:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 01:56:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 01:56:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 01:56:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 01:56:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 01:56:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-09 01:56:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:56:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:56:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:56:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:56:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-09 01:56:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-09 01:56:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-09 01:56:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-09 01:56:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-09 01:56:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-09 01:56:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-09 01:56:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:56:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:56:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:56:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:56:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:56:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 01:56:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 01:56:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 01:56:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 01:56:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 01:56:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 01:56:39,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:56:39,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:56:40,881 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-09 01:56:40,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:56:40,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:56:40,911 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:56:40,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:56:40 BoogieIcfgContainer [2024-11-09 01:56:40,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:56:40,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:56:40,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:56:40,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:56:40,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:56:38" (1/3) ... [2024-11-09 01:56:40,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ec92c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:56:40, skipping insertion in model container [2024-11-09 01:56:40,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:56:38" (2/3) ... [2024-11-09 01:56:40,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ec92c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:56:40, skipping insertion in model container [2024-11-09 01:56:40,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:56:40" (3/3) ... [2024-11-09 01:56:40,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2024-11-09 01:56:40,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:56:40,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:56:40,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:56:41,006 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;@5feddc1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:56:41,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:56:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:41,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:41,027 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:41,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-09 01:56:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511866183] [2024-11-09 01:56:41,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:41,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:41,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:41,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:41,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:56:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:41,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:56:41,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 01:56:41,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:41,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511866183] [2024-11-09 01:56:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511866183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:41,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:41,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:56:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058026965] [2024-11-09 01:56:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:41,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:56:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:56:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:56:41,598 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:41,631 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-09 01:56:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:56:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-09 01:56:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:41,643 INFO L225 Difference]: With dead ends: 179 [2024-11-09 01:56:41,644 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:56:41,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:56:41,652 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:41,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:56:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:56:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-09 01:56:41,701 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-09 01:56:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:41,702 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-09 01:56:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-09 01:56:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:41,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:41,708 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:41,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:56:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:41,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:41,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-09 01:56:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000264203] [2024-11-09 01:56:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:41,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:41,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:41,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:56:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:42,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:56:42,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:56:42,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:42,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000264203] [2024-11-09 01:56:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000264203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:56:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706247629] [2024-11-09 01:56:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:42,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:42,428 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:42,544 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-09 01:56:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-09 01:56:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:42,548 INFO L225 Difference]: With dead ends: 177 [2024-11-09 01:56:42,548 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:56:42,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:42,550 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:42,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:56:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:56:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:56:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:56:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-09 01:56:42,561 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-09 01:56:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:42,562 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-09 01:56:42,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-09 01:56:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:42,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:42,566 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:42,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:56:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:42,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:42,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-09 01:56:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039242212] [2024-11-09 01:56:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:42,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:42,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:56:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:43,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:56:43,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:43,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:43,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039242212] [2024-11-09 01:56:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039242212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:56:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416396641] [2024-11-09 01:56:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:43,652 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:45,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:56:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:45,737 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-11-09 01:56:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-09 01:56:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:45,740 INFO L225 Difference]: With dead ends: 267 [2024-11-09 01:56:45,740 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 01:56:45,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-09 01:56:45,742 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:45,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 01:56:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 01:56:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-11-09 01:56:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 153 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-11-09 01:56:45,780 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 98 [2024-11-09 01:56:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-11-09 01:56:45,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-11-09 01:56:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:45,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:45,787 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:45,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:56:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:45,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -688549779, now seen corresponding path program 1 times [2024-11-09 01:56:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:45,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874679388] [2024-11-09 01:56:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:45,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:45,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:56:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:46,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:56:46,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 8 proven. 60 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 01:56:46,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:56:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:47,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874679388] [2024-11-09 01:56:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874679388] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:56:47,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:56:47,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-09 01:56:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567587031] [2024-11-09 01:56:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:47,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:56:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:56:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:56:47,210 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:47,384 INFO L93 Difference]: Finished difference Result 411 states and 595 transitions. [2024-11-09 01:56:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:56:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-09 01:56:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:47,387 INFO L225 Difference]: With dead ends: 411 [2024-11-09 01:56:47,387 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 01:56:47,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:56:47,389 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 82 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:47,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 361 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:56:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 01:56:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 184. [2024-11-09 01:56:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.391304347826087) internal successors, (224), 161 states have internal predecessors, (224), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2024-11-09 01:56:47,405 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 98 [2024-11-09 01:56:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:47,405 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2024-11-09 01:56:47,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2024-11-09 01:56:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 01:56:47,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:47,407 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:47,425 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-09 01:56:47,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:47,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:47,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash -946715217, now seen corresponding path program 1 times [2024-11-09 01:56:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593721500] [2024-11-09 01:56:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:47,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:47,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:56:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:48,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:56:48,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:56:48,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:48,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593721500] [2024-11-09 01:56:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593721500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:56:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679658744] [2024-11-09 01:56:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:48,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:56:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:56:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:48,085 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:48,126 INFO L93 Difference]: Finished difference Result 369 states and 531 transitions. [2024-11-09 01:56:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:56:48,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-09 01:56:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:48,131 INFO L225 Difference]: With dead ends: 369 [2024-11-09 01:56:48,131 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 01:56:48,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:56:48,133 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:48,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:56:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 01:56:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 01:56:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.3818181818181818) internal successors, (228), 165 states have internal predecessors, (228), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 268 transitions. [2024-11-09 01:56:48,158 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 268 transitions. Word has length 98 [2024-11-09 01:56:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 268 transitions. [2024-11-09 01:56:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 01:56:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 268 transitions. [2024-11-09 01:56:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:56:48,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:48,163 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:48,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:56:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:48,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:48,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-09 01:56:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655952072] [2024-11-09 01:56:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:48,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:48,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:56:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:48,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:56:48,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:48,935 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-09 01:56:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:56:48,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:48,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655952072] [2024-11-09 01:56:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655952072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:48,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:56:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043630101] [2024-11-09 01:56:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:56:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:56:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:56:48,981 INFO L87 Difference]: Start difference. First operand 188 states and 268 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:50,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:56:53,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:56:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:53,428 INFO L93 Difference]: Finished difference Result 375 states and 535 transitions. [2024-11-09 01:56:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:56:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-11-09 01:56:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:53,431 INFO L225 Difference]: With dead ends: 375 [2024-11-09 01:56:53,431 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:56:53,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:56:53,432 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:53,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 01:56:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:56:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-09 01:56:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.3696969696969696) internal successors, (226), 165 states have internal predecessors, (226), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-11-09 01:56:53,444 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 100 [2024-11-09 01:56:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:53,444 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-11-09 01:56:53,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-11-09 01:56:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 01:56:53,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:53,446 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:56:53,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:53,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:53,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1465191154, now seen corresponding path program 1 times [2024-11-09 01:56:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740548238] [2024-11-09 01:56:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:53,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:53,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:53,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:56:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:54,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:56:54,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 01:56:54,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:54,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740548238] [2024-11-09 01:56:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740548238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:56:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104965442] [2024-11-09 01:56:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:54,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:56:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:56:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:56:54,149 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 01:56:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:54,288 INFO L93 Difference]: Finished difference Result 381 states and 539 transitions. [2024-11-09 01:56:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:56:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2024-11-09 01:56:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:54,290 INFO L225 Difference]: With dead ends: 381 [2024-11-09 01:56:54,290 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 01:56:54,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:56:54,291 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:54,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 543 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:56:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 01:56:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2024-11-09 01:56:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.3575757575757577) internal successors, (224), 165 states have internal predecessors, (224), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-09 01:56:54,304 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 102 [2024-11-09 01:56:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:54,304 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-09 01:56:54,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 01:56:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-09 01:56:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 01:56:54,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:54,306 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:54,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 01:56:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:54,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:54,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 921318352, now seen corresponding path program 1 times [2024-11-09 01:56:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127881161] [2024-11-09 01:56:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:54,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:54,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:54,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:56:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:56:54,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:56:55,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:56:55,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-09 01:56:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:56:55,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:56:55,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:56:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127881161] [2024-11-09 01:56:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127881161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:56:55,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:56:55,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:56:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742688591] [2024-11-09 01:56:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:56:55,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:56:55,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:56:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:56:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:56:55,231 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:57,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:56:59,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:56:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:56:59,525 INFO L93 Difference]: Finished difference Result 375 states and 527 transitions. [2024-11-09 01:56:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:56:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-11-09 01:56:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:56:59,527 INFO L225 Difference]: With dead ends: 375 [2024-11-09 01:56:59,527 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:56:59,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:56:59,528 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 99 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:56:59,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 366 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 01:56:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:56:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-09 01:56:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 165 states have (on average 1.3454545454545455) internal successors, (222), 165 states have internal predecessors, (222), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:56:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2024-11-09 01:56:59,545 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 102 [2024-11-09 01:56:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:56:59,545 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2024-11-09 01:56:59,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:56:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2024-11-09 01:56:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:56:59,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:56:59,547 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:56:59,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:56:59,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:59,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:56:59,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:56:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1515475638, now seen corresponding path program 1 times [2024-11-09 01:56:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:56:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837857438] [2024-11-09 01:56:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:56:59,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:56:59,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:56:59,750 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:56:59,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:57:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:09,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 01:57:09,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:13,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:57:18,144 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 237 treesize of output 177 [2024-11-09 01:57:18,151 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 201 treesize of output 141 [2024-11-09 01:57:18,159 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 119 treesize of output 83 [2024-11-09 01:57:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 4 proven. 128 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 01:57:18,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:57:29,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837857438] [2024-11-09 01:57:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837857438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:57:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83423978] [2024-11-09 01:57:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:57:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:57:29,570 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:57:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 01:57:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:30,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:57:30,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:32,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:57:32,145 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-09 01:57:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:57:33,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [83423978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:57:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2024-11-09 01:57:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546581099] [2024-11-09 01:57:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:57:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:57:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 01:57:33,057 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:57:35,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:57:38,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:57:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:38,266 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2024-11-09 01:57:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:57:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-11-09 01:57:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:38,268 INFO L225 Difference]: With dead ends: 373 [2024-11-09 01:57:38,268 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 01:57:38,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 01:57:38,270 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:38,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 368 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 01:57:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 01:57:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-11-09 01:57:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 161 states have internal predecessors, (216), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:57:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 256 transitions. [2024-11-09 01:57:38,279 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 256 transitions. Word has length 104 [2024-11-09 01:57:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 256 transitions. [2024-11-09 01:57:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:57:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 256 transitions. [2024-11-09 01:57:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:57:38,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:38,281 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:57:38,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-09 01:57:38,502 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:57:38,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:57:38,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1481158802, now seen corresponding path program 1 times [2024-11-09 01:57:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076146769] [2024-11-09 01:57:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:38,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:57:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:38,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:57:38,685 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-09 01:57:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:41,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:57:41,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:41,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:57:41,295 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 155 treesize of output 65 [2024-11-09 01:57:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 01:57:41,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:57:41,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:57:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076146769] [2024-11-09 01:57:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076146769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:57:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:57:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:57:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328833749] [2024-11-09 01:57:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:57:41,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:57:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:57:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:57:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:57:41,320 INFO L87 Difference]: Start difference. First operand 184 states and 256 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:57:43,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:57:45,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:57:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:57:45,342 INFO L93 Difference]: Finished difference Result 367 states and 511 transitions. [2024-11-09 01:57:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:57:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-09 01:57:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:57:45,347 INFO L225 Difference]: With dead ends: 367 [2024-11-09 01:57:45,347 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 01:57:45,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:57:45,348 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 80 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:57:45,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 361 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 01:57:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 01:57:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-09 01:57:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.329192546583851) internal successors, (214), 161 states have internal predecessors, (214), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 01:57:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 254 transitions. [2024-11-09 01:57:45,358 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 254 transitions. Word has length 106 [2024-11-09 01:57:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:57:45,358 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 254 transitions. [2024-11-09 01:57:45,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 01:57:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 254 transitions. [2024-11-09 01:57:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:57:45,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:57:45,360 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:57:45,376 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-09 01:57:45,560 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-09 01:57:45,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:57:45,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:57:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1845739404, now seen corresponding path program 1 times [2024-11-09 01:57:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:57:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246895854] [2024-11-09 01:57:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:57:45,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:57:45,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:57:45,563 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-09 01:57:45,564 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-09 01:57:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:57:55,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 01:57:55,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:57:59,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1