./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-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-wip.dd.update-z3-fca748b-m [2024-11-20 08:50:35,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:50:35,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:50:35,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:50:35,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:50:35,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:50:35,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:50:35,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:50:35,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:50:35,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:50:35,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:50:35,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:50:35,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:50:35,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:50:35,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:50:35,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:50:35,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:50:35,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:50:35,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:50:35,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:50:35,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:50:35,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:50:35,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:50:35,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:50:35,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:50:35,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:50:35,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:50:35,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:50:35,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:50:35,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:50:35,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:50:35,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:50:35,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:50:35,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:50:35,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:50:35,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:50:35,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:50:35,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:50:35,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:50:35,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:50:35,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:50:35,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:50:35,415 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-20 08:50:35,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:50:35,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:50:35,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:50:35,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:50:35,786 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:50:35,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:37,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:50:37,451 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:50:37,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:37,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51dfff00/8170a98f82934c129452352b187741de/FLAG1efcbdcff [2024-11-20 08:50:37,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51dfff00/8170a98f82934c129452352b187741de [2024-11-20 08:50:37,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:50:37,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:50:37,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:50:37,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:50:37,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:50:37,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:37,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191ab5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37, skipping insertion in model container [2024-11-20 08:50:37,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:37,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:50:37,742 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-20 08:50:37,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:50:37,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:50:37,853 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-20 08:50:37,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:50:37,909 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:50:37,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37 WrapperNode [2024-11-20 08:50:37,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:50:37,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:50:37,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:50:37,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:50:37,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:37,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:37,978 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2024-11-20 08:50:37,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:50:37,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:50:37,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:50:37,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:50:38,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,054 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-20 08:50:38,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:50:38,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:50:38,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:50:38,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:50:38,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (1/1) ... [2024-11-20 08:50:38,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:50:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:50:38,156 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-20 08:50:38,165 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-20 08:50:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:50:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:50:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:50:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:50:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:50:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:50:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:50:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 08:50:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 08:50:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-20 08:50:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:50:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:50:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:50:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-20 08:50:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-20 08:50:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-20 08:50:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-20 08:50:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-20 08:50:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-20 08:50:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:50:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:50:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:50:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:50:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:50:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-20 08:50:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-20 08:50:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 08:50:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:50:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-20 08:50:38,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:50:38,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-20 08:50:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-20 08:50:38,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-20 08:50:38,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:50:38,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:50:38,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:50:38,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:50:38,949 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-20 08:50:38,949 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:50:38,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:50:38,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:50:38,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:50:38 BoogieIcfgContainer [2024-11-20 08:50:38,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:50:38,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:50:38,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:50:38,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:50:38,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:50:37" (1/3) ... [2024-11-20 08:50:38,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189cf0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:50:38, skipping insertion in model container [2024-11-20 08:50:38,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:37" (2/3) ... [2024-11-20 08:50:38,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189cf0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:50:38, skipping insertion in model container [2024-11-20 08:50:38,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:50:38" (3/3) ... [2024-11-20 08:50:38,980 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:38,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:50:38,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:50:39,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:50:39,079 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;@45b1ac0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:50:39,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:50:39,085 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-20 08:50:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:39,100 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-20 08:50:39,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-20 08:50:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906429688] [2024-11-20 08:50:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:50:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:50:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:50:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:50:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:50:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:50:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:50:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:50:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:50:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:50:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:39,536 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-20 08:50:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:50:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906429688] [2024-11-20 08:50:39,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906429688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:50:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602051951] [2024-11-20 08:50:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:50:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:50:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:50:39,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:50:39,584 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-20 08:50:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:39,628 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-20 08:50:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:50:39,631 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-20 08:50:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:39,641 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:50:39,642 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 08:50:39,646 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-20 08:50:39,653 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-20 08:50:39,654 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-20 08:50:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 08:50:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 08:50:39,725 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-20 08:50:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-20 08:50:39,732 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-20 08:50:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-20 08:50:39,735 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-20 08:50:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-20 08:50:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:39,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:39,742 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-20 08:50:39,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:50:39,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:39,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-20 08:50:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953415208] [2024-11-20 08:50:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:50:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:50:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:50:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:50:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:50:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:50:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:50:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:50:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:50:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:50:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,079 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-20 08:50:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:50:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953415208] [2024-11-20 08:50:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953415208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:50:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253915600] [2024-11-20 08:50:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:40,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:50:40,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:50:40,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:50:40,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:50:40,091 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-20 08:50:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:40,144 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-20 08:50:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:50:40,145 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-20 08:50:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:40,146 INFO L225 Difference]: With dead ends: 177 [2024-11-20 08:50:40,146 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:50:40,147 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-20 08:50:40,148 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-20 08:50:40,150 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-20 08:50:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:50:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:50:40,164 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-20 08:50:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-20 08:50:40,169 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-20 08:50:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:40,171 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-20 08:50:40,171 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-20 08:50:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-20 08:50:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:40,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:40,176 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-20 08:50:40,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:50:40,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:40,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-20 08:50:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304249358] [2024-11-20 08:50:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:50:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:50:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:50:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:50:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:50:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:50:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:50:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:50:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:50:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:50:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,539 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-20 08:50:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:50:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304249358] [2024-11-20 08:50:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304249358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:40,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:50:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327777680] [2024-11-20 08:50:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:50:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:50:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:50:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:50:40,548 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-20 08:50:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:40,597 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-20 08:50:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:50:40,598 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-20 08:50:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:40,599 INFO L225 Difference]: With dead ends: 181 [2024-11-20 08:50:40,599 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 08:50:40,600 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-20 08:50:40,601 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-20 08:50:40,602 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-20 08:50:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 08:50:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-20 08:50:40,615 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-20 08:50:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-20 08:50:40,620 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2024-11-20 08:50:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-20 08:50:40,621 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-20 08:50:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-20 08:50:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:50:40,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:40,623 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-20 08:50:40,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:50:40,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -561605494, now seen corresponding path program 1 times [2024-11-20 08:50:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:40,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546418370] [2024-11-20 08:50:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:50:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:50:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:50:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:50:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:50:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:50:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:50:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:50:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:50:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:50:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,032 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-20 08:50:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:50:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546418370] [2024-11-20 08:50:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546418370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:50:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108794177] [2024-11-20 08:50:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:41,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:50:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:50:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:50:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:50:41,038 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-20 08:50:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:41,130 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2024-11-20 08:50:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:50:41,131 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-20 08:50:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:41,135 INFO L225 Difference]: With dead ends: 273 [2024-11-20 08:50:41,135 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 08:50:41,136 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-20 08:50:41,139 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-20 08:50:41,140 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-20 08:50:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 08:50:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-20 08:50:41,174 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-20 08:50:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2024-11-20 08:50:41,176 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 100 [2024-11-20 08:50:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:41,178 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2024-11-20 08:50:41,179 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-20 08:50:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2024-11-20 08:50:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:50:41,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:41,184 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-20 08:50:41,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:50:41,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1582673848, now seen corresponding path program 1 times [2024-11-20 08:50:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96227509] [2024-11-20 08:50:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:50:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:50:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:50:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:50:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:50:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:50:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:50:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:50:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:50:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:50:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:41,674 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-20 08:50:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:50:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96227509] [2024-11-20 08:50:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96227509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:50:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192981441] [2024-11-20 08:50:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:50:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:50:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:50:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:50:41,678 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-20 08:50:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:41,781 INFO L93 Difference]: Finished difference Result 415 states and 596 transitions. [2024-11-20 08:50:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:50:41,782 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-20 08:50:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:41,784 INFO L225 Difference]: With dead ends: 415 [2024-11-20 08:50:41,784 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 08:50:41,788 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-20 08:50:41,789 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 37 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 08:50:41,790 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-20 08:50:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 08:50:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2024-11-20 08:50:41,816 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-20 08:50:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 285 transitions. [2024-11-20 08:50:41,818 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 285 transitions. Word has length 100 [2024-11-20 08:50:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:41,819 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 285 transitions. [2024-11-20 08:50:41,819 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-20 08:50:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 285 transitions. [2024-11-20 08:50:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:50:41,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:41,821 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-20 08:50:41,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:50:41,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-20 08:50:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:50:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651844958] [2024-11-20 08:50:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:50:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:50:41,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:50:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:50:41,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:50:41,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:50:41,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:50:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:50:41,991 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 08:50:42,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:50:42,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:50:42 BoogieIcfgContainer [2024-11-20 08:50:42,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:50:42,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:50:42,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:50:42,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:50:42,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:50:38" (3/4) ... [2024-11-20 08:50:42,150 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:50:42,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:50:42,153 INFO L158 Benchmark]: Toolchain (without parser) took 4663.65ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 70.7MB in the beginning and 45.3MB in the end (delta: 25.4MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,154 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:50:42,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.16ms. Allocated memory is still 146.8MB. Free memory was 70.5MB in the beginning and 108.2MB in the end (delta: -37.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.82ms. Allocated memory is still 146.8MB. Free memory was 108.2MB in the beginning and 104.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,154 INFO L158 Benchmark]: Boogie Preprocessor took 119.79ms. Allocated memory is still 146.8MB. Free memory was 104.8MB in the beginning and 99.8MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,155 INFO L158 Benchmark]: RCFGBuilder took 869.35ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 87.2MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,155 INFO L158 Benchmark]: TraceAbstraction took 3174.13ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 86.0MB in the beginning and 45.3MB in the end (delta: 40.7MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-11-20 08:50:42,157 INFO L158 Benchmark]: Witness Printer took 5.06ms. Allocated memory is still 176.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:50:42,159 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.21ms. Allocated memory is still 146.8MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.16ms. Allocated memory is still 146.8MB. Free memory was 70.5MB in the beginning and 108.2MB in the end (delta: -37.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.82ms. Allocated memory is still 146.8MB. Free memory was 108.2MB in the beginning and 104.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.79ms. Allocated memory is still 146.8MB. Free memory was 104.8MB in the beginning and 99.8MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 869.35ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 87.2MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3174.13ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 86.0MB in the beginning and 45.3MB in the end (delta: 40.7MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Witness Printer took 5.06ms. Allocated memory is still 176.2MB. Free memory is still 45.3MB. 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.2s 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.2s SatisfiabilityAnalysisTime, 1.6s 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-20 08:50:42,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-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-wip.dd.update-z3-fca748b-m [2024-11-20 08:50:44,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:50:44,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:50:44,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:50:44,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:50:44,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:50:44,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:50:44,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:50:44,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:50:44,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:50:44,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:50:44,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:50:44,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:50:44,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:50:44,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:50:44,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:50:44,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:50:44,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:50:44,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:50:44,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:50:44,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:50:44,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:50:44,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:50:44,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:50:44,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:50:44,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:50:44,757 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:50:44,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:50:44,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:50:44,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:50:44,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:50:44,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:50:44,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:50:44,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:50:44,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:50:44,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:50:44,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:50:44,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:50:44,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:50:44,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:50:44,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:50:44,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:50:44,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:50:44,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:50:44,765 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-20 08:50:45,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:50:45,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:50:45,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:50:45,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:50:45,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:50:45,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:46,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:50:47,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:50:47,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:47,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2770c416e/d6916048f09e47318c5642bbc4db6e12/FLAG4d52ab28b [2024-11-20 08:50:47,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2770c416e/d6916048f09e47318c5642bbc4db6e12 [2024-11-20 08:50:47,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:50:47,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:50:47,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:50:47,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:50:47,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:50:47,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02365e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47, skipping insertion in model container [2024-11-20 08:50:47,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:50:47,627 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-20 08:50:47,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:50:47,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:50:47,736 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-20 08:50:47,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:50:47,831 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:50:47,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47 WrapperNode [2024-11-20 08:50:47,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:50:47,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:50:47,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:50:47,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:50:47,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,910 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2024-11-20 08:50:47,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:50:47,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:50:47,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:50:47,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:50:47,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,976 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-20 08:50:47,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:47,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:50:48,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:50:48,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:50:48,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:50:48,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (1/1) ... [2024-11-20 08:50:48,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:50:48,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:50:48,085 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-20 08:50:48,092 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-20 08:50:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:50:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:50:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:50:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-20 08:50:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-20 08:50:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:50:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:50:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-20 08:50:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 08:50:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-20 08:50:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-20 08:50:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-20 08:50:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-20 08:50:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-20 08:50:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:50:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-20 08:50:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-20 08:50:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-20 08:50:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:50:48,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:50:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:50:48,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:50:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:50:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:50:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:50:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-20 08:50:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-20 08:50:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-20 08:50:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-20 08:50:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-20 08:50:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-20 08:50:48,405 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:50:48,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:50:54,212 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-20 08:50:54,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:50:54,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:50:54,234 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:50:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:50:54 BoogieIcfgContainer [2024-11-20 08:50:54,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:50:54,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:50:54,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:50:54,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:50:54,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:50:47" (1/3) ... [2024-11-20 08:50:54,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef527f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:50:54, skipping insertion in model container [2024-11-20 08:50:54,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:50:47" (2/3) ... [2024-11-20 08:50:54,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef527f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:50:54, skipping insertion in model container [2024-11-20 08:50:54,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:50:54" (3/3) ... [2024-11-20 08:50:54,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2024-11-20 08:50:54,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:50:54,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:50:54,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:50:54,340 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;@2dca5411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:50:54,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:50:54,344 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-20 08:50:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:54,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:54,354 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-20 08:50:54,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-20 08:50:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:50:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474886812] [2024-11-20 08:50:54,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:54,373 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-20 08:50:54,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:50:54,377 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-20 08:50:54,379 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-20 08:50:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:54,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:50:54,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:50:54,943 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-20 08:50:54,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:50:54,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:50:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474886812] [2024-11-20 08:50:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474886812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:54,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:50:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776997750] [2024-11-20 08:50:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:50:54,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:50:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:50:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:50:54,986 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-20 08:50:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:55,024 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-20 08:50:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:50:55,027 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-20 08:50:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:55,034 INFO L225 Difference]: With dead ends: 179 [2024-11-20 08:50:55,035 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 08:50:55,037 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-20 08:50:55,041 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-20 08:50:55,042 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-20 08:50:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 08:50:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 08:50:55,074 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-20 08:50:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-20 08:50:55,077 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-20 08:50:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-20 08:50:55,078 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-20 08:50:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-20 08:50:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:55,081 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-20 08:50:55,093 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-20 08:50:55,282 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-20 08:50:55,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-20 08:50:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:50:55,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933091200] [2024-11-20 08:50:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:55,285 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-20 08:50:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:50:55,288 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-20 08:50:55,289 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-20 08:50:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:55,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:50:55,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:50:55,865 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-20 08:50:55,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:50:55,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:50:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933091200] [2024-11-20 08:50:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933091200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:50:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248419170] [2024-11-20 08:50:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:50:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:50:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:50:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:50:55,871 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-20 08:50:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:50:55,984 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-20 08:50:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:50:55,985 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-20 08:50:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:50:55,987 INFO L225 Difference]: With dead ends: 177 [2024-11-20 08:50:55,987 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:50:55,988 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-20 08:50:55,993 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-20 08:50:55,993 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-20 08:50:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:50:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 08:50:56,008 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-20 08:50:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-20 08:50:56,012 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-20 08:50:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:50:56,014 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-20 08:50:56,014 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-20 08:50:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-20 08:50:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:50:56,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:50:56,017 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-20 08:50:56,033 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-20 08:50:56,223 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-20 08:50:56,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:50:56,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:50:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-20 08:50:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:50:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807329144] [2024-11-20 08:50:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:50:56,226 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-20 08:50:56,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:50:56,229 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-20 08:50:56,230 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-20 08:50:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:50:56,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:50:56,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:50:57,257 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-20 08:50:57,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:50:57,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:50:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807329144] [2024-11-20 08:50:57,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807329144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:50:57,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:50:57,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:50:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298137368] [2024-11-20 08:50:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:50:57,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:50:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:50:57,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:50:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:50:57,261 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-20 08:50:59,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:51:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:00,156 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-11-20 08:51:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:51:00,157 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-20 08:51:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:00,160 INFO L225 Difference]: With dead ends: 267 [2024-11-20 08:51:00,161 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 08:51:00,162 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-20 08:51:00,163 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:51:00,163 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.8s Time] [2024-11-20 08:51:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 08:51:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-11-20 08:51:00,201 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-20 08:51:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-11-20 08:51:00,205 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 98 [2024-11-20 08:51:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:00,210 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-11-20 08:51:00,210 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-20 08:51:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-11-20 08:51:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:51:00,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:00,212 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-20 08:51:00,235 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-20 08:51:00,413 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-20 08:51:00,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash -688549779, now seen corresponding path program 1 times [2024-11-20 08:51:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195545203] [2024-11-20 08:51:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:00,415 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-20 08:51:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:00,419 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-20 08:51:00,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:51:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:00,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 08:51:00,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:01,831 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-20 08:51:01,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:51:02,100 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-20 08:51:02,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195545203] [2024-11-20 08:51:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195545203] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:51:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:51:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-20 08:51:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211027461] [2024-11-20 08:51:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:51:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:51:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:51:02,107 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-20 08:51:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:02,367 INFO L93 Difference]: Finished difference Result 411 states and 595 transitions. [2024-11-20 08:51:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:51:02,368 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-20 08:51:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:02,371 INFO L225 Difference]: With dead ends: 411 [2024-11-20 08:51:02,371 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 08:51:02,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:51:02,373 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 82 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:51:02,373 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.2s Time] [2024-11-20 08:51:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 08:51:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 184. [2024-11-20 08:51:02,388 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-20 08:51:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2024-11-20 08:51:02,392 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 98 [2024-11-20 08:51:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2024-11-20 08:51:02,393 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-20 08:51:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2024-11-20 08:51:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 08:51:02,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:02,398 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-20 08:51:02,418 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-20 08:51:02,599 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-20 08:51:02,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:02,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash -946715217, now seen corresponding path program 1 times [2024-11-20 08:51:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057712546] [2024-11-20 08:51:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:02,601 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-20 08:51:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:02,604 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-20 08:51:02,605 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-20 08:51:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:03,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:51:03,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:03,108 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-20 08:51:03,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:51:03,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057712546] [2024-11-20 08:51:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057712546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:51:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:51:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:51:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403453065] [2024-11-20 08:51:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:51:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:51:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:51:03,111 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-20 08:51:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:03,191 INFO L93 Difference]: Finished difference Result 369 states and 531 transitions. [2024-11-20 08:51:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:51:03,194 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-20 08:51:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:03,198 INFO L225 Difference]: With dead ends: 369 [2024-11-20 08:51:03,200 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 08:51:03,201 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-20 08:51:03,202 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-20 08:51:03,202 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-20 08:51:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 08:51:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-20 08:51:03,226 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-20 08:51:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 268 transitions. [2024-11-20 08:51:03,228 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 268 transitions. Word has length 98 [2024-11-20 08:51:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:03,228 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 268 transitions. [2024-11-20 08:51:03,228 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-20 08:51:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 268 transitions. [2024-11-20 08:51:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 08:51:03,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:03,230 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-20 08:51:03,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 08:51:03,430 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-20 08:51:03,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-20 08:51:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32727483] [2024-11-20 08:51:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:03,432 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-20 08:51:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:03,435 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-20 08:51:03,437 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-20 08:51:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:03,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:51:03,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:04,069 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-20 08:51:04,116 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-20 08:51:04,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:51:04,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32727483] [2024-11-20 08:51:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32727483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:51:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:51:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:51:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817421861] [2024-11-20 08:51:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:04,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:51:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:51:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:51:04,123 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-20 08:51:06,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:51:10,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:51:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:10,195 INFO L93 Difference]: Finished difference Result 375 states and 535 transitions. [2024-11-20 08:51:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:51:10,196 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-20 08:51:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:10,198 INFO L225 Difference]: With dead ends: 375 [2024-11-20 08:51:10,198 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 08:51:10,199 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-20 08:51:10,200 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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, 6.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:51:10,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-20 08:51:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 08:51:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-20 08:51:10,210 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-20 08:51:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-11-20 08:51:10,211 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 100 [2024-11-20 08:51:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:10,212 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-11-20 08:51:10,212 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-20 08:51:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-11-20 08:51:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 08:51:10,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:10,215 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-20 08:51:10,237 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-20 08:51:10,415 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-20 08:51:10,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1465191154, now seen corresponding path program 1 times [2024-11-20 08:51:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302652675] [2024-11-20 08:51:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:10,417 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-20 08:51:10,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:10,418 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-20 08:51:10,419 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-20 08:51:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:10,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:51:10,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:10,989 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-20 08:51:10,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:51:10,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302652675] [2024-11-20 08:51:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302652675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:51:10,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:51:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:51:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043903320] [2024-11-20 08:51:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:10,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:51:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:51:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:51:10,991 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-20 08:51:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:11,160 INFO L93 Difference]: Finished difference Result 381 states and 539 transitions. [2024-11-20 08:51:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:51:11,161 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-20 08:51:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:11,163 INFO L225 Difference]: With dead ends: 381 [2024-11-20 08:51:11,163 INFO L226 Difference]: Without dead ends: 192 [2024-11-20 08:51:11,163 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-20 08:51:11,164 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-20 08:51:11,165 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-20 08:51:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-20 08:51:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2024-11-20 08:51:11,177 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-20 08:51:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-11-20 08:51:11,179 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 102 [2024-11-20 08:51:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:11,179 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-11-20 08:51:11,180 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-20 08:51:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-11-20 08:51:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 08:51:11,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:11,181 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-20 08:51:11,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:51:11,382 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-20 08:51:11,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 921318352, now seen corresponding path program 1 times [2024-11-20 08:51:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193230279] [2024-11-20 08:51:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:11,384 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-20 08:51:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:11,386 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-20 08:51:11,387 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-20 08:51:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:11,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:51:11,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:12,123 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-20 08:51:12,188 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-20 08:51:12,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:51:12,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193230279] [2024-11-20 08:51:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193230279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:51:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:51:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:51:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768785824] [2024-11-20 08:51:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:12,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:51:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:12,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:51:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:51:12,192 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-20 08:51:14,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:51:16,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:51:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:51:16,862 INFO L93 Difference]: Finished difference Result 375 states and 527 transitions. [2024-11-20 08:51:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:51:16,863 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-20 08:51:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:51:16,864 INFO L225 Difference]: With dead ends: 375 [2024-11-20 08:51:16,864 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 08:51:16,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:51:16,865 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 99 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:51:16,865 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.6s Time] [2024-11-20 08:51:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 08:51:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-20 08:51:16,875 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-20 08:51:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2024-11-20 08:51:16,878 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 102 [2024-11-20 08:51:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:51:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2024-11-20 08:51:16,878 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-20 08:51:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2024-11-20 08:51:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-20 08:51:16,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:51:16,880 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-20 08:51:16,895 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-20 08:51:17,080 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-20 08:51:17,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:51:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:51:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1515475638, now seen corresponding path program 1 times [2024-11-20 08:51:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:51:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332279390] [2024-11-20 08:51:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:17,082 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-20 08:51:17,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:51:17,085 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-20 08:51:17,089 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-20 08:51:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:27,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-20 08:51:27,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:32,870 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-20 08:51:37,936 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-20 08:51:37,947 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-20 08:51:37,958 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-20 08:51:39,145 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-20 08:51:39,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:51:52,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:51:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332279390] [2024-11-20 08:51:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332279390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:51:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [418638424] [2024-11-20 08:51:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:51:52,538 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:51:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:51:52,540 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-20 08:51:52,541 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-20 08:51:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:51:53,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 08:51:53,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:51:55,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:51:55,342 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-20 08:51:56,268 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-20 08:51:56,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:51:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [418638424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:51:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:51:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2024-11-20 08:51:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289725659] [2024-11-20 08:51:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:51:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:51:56,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:51:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:51:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 08:51:56,271 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-20 08:51:59,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:52:01,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:52:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:52:01,866 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2024-11-20 08:52:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:52:01,867 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-20 08:52:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:52:01,869 INFO L225 Difference]: With dead ends: 373 [2024-11-20 08:52:01,869 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 08:52:01,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 08:52:01,871 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:52:01,872 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.7s Time] [2024-11-20 08:52:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 08:52:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-11-20 08:52:01,884 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-20 08:52:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 256 transitions. [2024-11-20 08:52:01,885 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 256 transitions. Word has length 104 [2024-11-20 08:52:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:52:01,886 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 256 transitions. [2024-11-20 08:52:01,886 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-20 08:52:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 256 transitions. [2024-11-20 08:52:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-20 08:52:01,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:52:01,887 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-20 08:52:01,903 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-20 08:52:02,108 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-20 08:52:02,288 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-20 08:52:02,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:52:02,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:52:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1481158802, now seen corresponding path program 1 times [2024-11-20 08:52:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:52:02,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76041294] [2024-11-20 08:52:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:52:02,289 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-20 08:52:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:52:02,291 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-20 08:52:02,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 08:52:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:52:04,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:52:04,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:52:04,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:52:04,953 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-20 08:52:04,990 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-20 08:52:04,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:52:04,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:52:04,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76041294] [2024-11-20 08:52:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76041294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:52:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:52:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:52:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140234761] [2024-11-20 08:52:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:52:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:52:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:52:04,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:52:04,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:52:04,992 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-20 08:52:07,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []