./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:35,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:35,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:21:35,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:35,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:35,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:35,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:35,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:35,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:35,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:35,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:35,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:35,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:35,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:35,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:35,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:35,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:35,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:35,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:21:35,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:35,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:35,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:35,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:35,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:35,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:35,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:35,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:35,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:35,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:35,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:35,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:35,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:35,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:35,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:35,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:35,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:35,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:21:35,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:21:35,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:35,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:35,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:35,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:35,803 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 -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-10 09:21:36,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:36,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:36,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:36,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:36,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:36,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:37,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:37,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:37,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:37,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faffb068/3864d5b9477744c19fe83505ae071a96/FLAG42265de58 [2024-11-10 09:21:37,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faffb068/3864d5b9477744c19fe83505ae071a96 [2024-11-10 09:21:37,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:37,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:37,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:37,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:37,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:37,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:37" (1/1) ... [2024-11-10 09:21:37,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609e9a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:37, skipping insertion in model container [2024-11-10 09:21:37,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:37" (1/1) ... [2024-11-10 09:21:37,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:38,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-10 09:21:38,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:38,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:38,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-10 09:21:38,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:38,206 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:38,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38 WrapperNode [2024-11-10 09:21:38,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:38,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:38,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:38,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:38,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,270 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2024-11-10 09:21:38,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:38,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:38,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:38,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:38,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,320 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-10 09:21:38,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:38,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:38,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:38,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:38,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (1/1) ... [2024-11-10 09:21:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:38,407 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-10 09:21:38,411 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-10 09:21:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:21:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:21:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:21:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:21:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:21:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:21:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:21:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:21:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:21:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:21:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:21:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:21:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:21:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:21:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:21:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:21:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:21:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:21:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:38,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:21:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:21:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:21:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:21:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:21:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:38,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:38,653 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:38,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:39,203 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~mem107#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite134#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short135#1;havoc property_#t~mem136#1;havoc property_#t~ite146#1;havoc property_#t~mem137#1;havoc property_#t~ite143#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short147#1; [2024-11-10 09:21:39,266 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:39,266 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:39,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:39,288 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 09:21:39,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:39 BoogieIcfgContainer [2024-11-10 09:21:39,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:39,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:39,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:39,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:39,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:37" (1/3) ... [2024-11-10 09:21:39,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3212cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:39, skipping insertion in model container [2024-11-10 09:21:39,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:38" (2/3) ... [2024-11-10 09:21:39,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3212cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:39, skipping insertion in model container [2024-11-10 09:21:39,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:39" (3/3) ... [2024-11-10 09:21:39,297 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:39,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:39,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:39,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:39,378 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;@13da7eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:39,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:39,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:39,394 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:21:39,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:39,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2115995147, now seen corresponding path program 1 times [2024-11-10 09:21:39,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:39,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545371297] [2024-11-10 09:21:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:21:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:21:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:21:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:21:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:21:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:21:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:21:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:21:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:21:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:21:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:21:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:21:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:21:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:21:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:21:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:21:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:21:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:21:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:21:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545371297] [2024-11-10 09:21:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545371297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685641485] [2024-11-10 09:21:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:21:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:39,910 INFO L87 Difference]: Start difference. First operand has 126 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:39,946 INFO L93 Difference]: Finished difference Result 244 states and 378 transitions. [2024-11-10 09:21:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-10 09:21:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:39,958 INFO L225 Difference]: With dead ends: 244 [2024-11-10 09:21:39,958 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 09:21:39,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10 09:21:39,965 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:21:39,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 09:21:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 09:21:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-10 09:21:40,023 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 145 [2024-11-10 09:21:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:40,024 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-10 09:21:40,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-10 09:21:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:21:40,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:40,031 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:21:40,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:21:40,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:40,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash -156228128, now seen corresponding path program 1 times [2024-11-10 09:21:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:21:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119458749] [2024-11-10 09:21:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:21:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:21:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331581408] [2024-11-10 09:21:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:40,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:40,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:21:40,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:21:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:40,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:21:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:21:41,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:21:41,082 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:21:41,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:21:41,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:21:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:21:41,290 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:21:41,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:21:41,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:21:41 BoogieIcfgContainer [2024-11-10 09:21:41,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:21:41,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:21:41,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:21:41,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:21:41,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:39" (3/4) ... [2024-11-10 09:21:41,420 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:21:41,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:21:41,424 INFO L158 Benchmark]: Toolchain (without parser) took 3583.36ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 100.6MB in the beginning and 189.0MB in the end (delta: -88.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:41,425 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:21:41,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.03ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 83.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 79.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,426 INFO L158 Benchmark]: Boogie Preprocessor took 81.07ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 74.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,426 INFO L158 Benchmark]: IcfgBuilder took 935.63ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 74.7MB in the beginning and 171.0MB in the end (delta: -96.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,426 INFO L158 Benchmark]: TraceAbstraction took 2126.24ms. Allocated memory is still 226.5MB. Free memory was 170.0MB in the beginning and 190.1MB in the end (delta: -20.1MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,427 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 226.5MB. Free memory was 190.1MB in the beginning and 189.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:21:41,433 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.19ms. Allocated memory is still 155.2MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.03ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 83.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 79.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.07ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 74.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 935.63ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 74.7MB in the beginning and 171.0MB in the end (delta: -96.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2126.24ms. Allocated memory is still 226.5MB. Free memory was 170.0MB in the beginning and 190.1MB in the end (delta: -20.1MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 226.5MB. Free memory was 190.1MB in the beginning and 189.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_4_ = 500; VAL [double_Array_0={4:0}, isInitial=0, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR unsigned_long_int_Array_0[4] [L91] last_1_unsigned_long_int_Array_0_4_ = unsigned_long_int_Array_0[4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L61] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] CALL assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] RET assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L63] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] CALL assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] RET assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L65] double_Array_0[0][1][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] double_Array_0[1][0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L74] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L78] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L102] RET updateVariables() [L103] CALL step() [L38] EXPR double_Array_0[0][1][1] [L38] EXPR double_Array_0[1][0][1] [L38] double_Array_0[1][1][1] = (double_Array_0[0][1][1] - double_Array_0[1][0][1]) [L39] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !(((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) [L46] EXPR unsigned_long_int_Array_0[2] [L46] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[2] [L48] EXPR unsigned_long_int_Array_0[4] [L48] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR signed_long_int_Array_0[0] [L48] unsigned long int stepLocal_0 = (unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0]; [L49] COND FALSE !(8 < stepLocal_0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] EXPR double_Array_0[0][1][1] [L52] EXPR double_Array_0[1][0][0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] COND FALSE !(double_Array_0[0][1][1] < double_Array_0[1][0][0]) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR double_Array_0[1][1][1] [L94] EXPR double_Array_0[0][1][1] [L94] EXPR double_Array_0[1][0][1] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94-L95] return (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 174 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 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-10 09:21:41,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.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 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:21:43,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:21:43,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:21:43,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:21:43,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:21:43,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:21:43,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:21:43,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:21:43,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:21:43,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:21:43,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:21:43,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:21:43,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:21:43,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:21:43,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:21:43,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:21:43,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:21:43,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:21:43,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:21:43,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:21:43,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:21:43,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:21:43,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:21:43,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:21:43,908 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:21:43,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:21:43,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:21:43,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:21:43,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:21:43,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:21:43,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:21:43,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:21:43,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:21:43,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:21:43,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:43,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:21:43,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:21:43,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:21:43,913 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:21:43,913 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:21:43,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:21:43,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:21:43,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:21:43,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:21:43,914 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 -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2024-11-10 09:21:44,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:21:44,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:21:44,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:21:44,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:21:44,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:21:44,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:45,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:21:46,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:21:46,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:46,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e396d4da6/7840c59c588a42b3af2ac5369879d78d/FLAG1d656c956 [2024-11-10 09:21:46,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e396d4da6/7840c59c588a42b3af2ac5369879d78d [2024-11-10 09:21:46,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:21:46,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:21:46,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:46,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:21:46,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:21:46,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3940f2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46, skipping insertion in model container [2024-11-10 09:21:46,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:21:46,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-10 09:21:46,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:46,763 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:21:46,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2024-11-10 09:21:46,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:21:46,859 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:21:46,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46 WrapperNode [2024-11-10 09:21:46,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:21:46,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:46,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:21:46,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:21:46,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,930 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-11-10 09:21:46,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:21:46,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:21:46,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:21:46,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:21:46,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,978 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2024-11-10 09:21:46,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:46,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:21:47,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:21:47,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:21:47,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:21:47,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (1/1) ... [2024-11-10 09:21:47,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:21:47,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:21:47,083 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-10 09:21:47,086 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-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:21:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:21:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:21:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:21:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:21:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:21:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:21:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:21:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:21:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:21:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:21:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:21:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:21:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:21:47,313 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:21:47,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:21:55,967 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short121#1;havoc property_#t~ite131#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~ite144#1;havoc property_#t~mem135#1;havoc property_#t~ite141#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short145#1; [2024-11-10 09:21:56,027 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-10 09:21:56,027 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:21:56,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:21:56,043 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:21:56,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:56 BoogieIcfgContainer [2024-11-10 09:21:56,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:21:56,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:21:56,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:21:56,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:21:56,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:21:46" (1/3) ... [2024-11-10 09:21:56,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a5f6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:56, skipping insertion in model container [2024-11-10 09:21:56,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:46" (2/3) ... [2024-11-10 09:21:56,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a5f6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:21:56, skipping insertion in model container [2024-11-10 09:21:56,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:21:56" (3/3) ... [2024-11-10 09:21:56,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2024-11-10 09:21:56,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:21:56,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:21:56,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:21:56,171 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;@4aec4bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:21:56,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:21:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:21:56,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:56,190 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:21:56,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1122082461, now seen corresponding path program 1 times [2024-11-10 09:21:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947649581] [2024-11-10 09:21:56,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:56,212 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-10 09:21:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:56,216 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-10 09:21:56,218 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-10 09:21:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:56,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:21:56,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-10 09:21:56,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:56,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947649581] [2024-11-10 09:21:56,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947649581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:56,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:56,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:21:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897969234] [2024-11-10 09:21:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:56,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:21:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:21:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:21:56,909 INFO L87 Difference]: Start difference. First operand has 120 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:21:56,950 INFO L93 Difference]: Finished difference Result 232 states and 362 transitions. [2024-11-10 09:21:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:21:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-10 09:21:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:21:56,962 INFO L225 Difference]: With dead ends: 232 [2024-11-10 09:21:56,962 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 09:21:56,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-10 09:21:56,970 INFO L432 NwaCegarLoop]: 168 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, 168 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-10 09:21:56,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:21:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 09:21:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-10 09:21:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:21:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-10 09:21:57,020 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-10 09:21:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:21:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-10 09:21:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:21:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-10 09:21:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:21:57,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:21:57,025 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:21:57,047 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:21:57,226 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-10 09:21:57,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:21:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:21:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1999506446, now seen corresponding path program 1 times [2024-11-10 09:21:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:21:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452266105] [2024-11-10 09:21:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:21:57,229 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-10 09:21:57,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:21:57,231 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-10 09:21:57,232 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-10 09:21:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:21:57,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:21:57,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:21:58,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:21:58,467 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 173 treesize of output 65 [2024-11-10 09:21:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-10 09:21:58,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:21:58,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:21:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452266105] [2024-11-10 09:21:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452266105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:21:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:21:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:21:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347914960] [2024-11-10 09:21:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:21:58,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:21:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:21:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:21:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:21:58,648 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:22:04,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:06,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:09,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:11,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:11,487 INFO L93 Difference]: Finished difference Result 228 states and 334 transitions. [2024-11-10 09:22:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:22:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-10 09:22:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:11,493 INFO L225 Difference]: With dead ends: 228 [2024-11-10 09:22:11,493 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:22:11,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:22:11,496 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 134 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:11,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 490 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2024-11-10 09:22:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:22:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-10 09:22:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:22:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2024-11-10 09:22:11,510 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 143 [2024-11-10 09:22:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:11,511 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2024-11-10 09:22:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:22:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2024-11-10 09:22:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:22:11,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:11,514 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:22:11,534 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-10 09:22:11,714 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-10 09:22:11,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1712139028, now seen corresponding path program 1 times [2024-11-10 09:22:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222610571] [2024-11-10 09:22:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:11,717 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-10 09:22:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:11,719 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-10 09:22:11,720 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-10 09:22:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:22:12,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:22:12,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:22:12,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:22:12,906 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 173 treesize of output 65 [2024-11-10 09:22:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-10 09:22:12,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:22:12,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:22:12,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222610571] [2024-11-10 09:22:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222610571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:22:12,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:22:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:22:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550278400] [2024-11-10 09:22:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:22:12,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:22:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:22:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:22:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:22:12,979 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:22:18,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:19,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:24,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:27,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:22:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:22:27,902 INFO L93 Difference]: Finished difference Result 228 states and 332 transitions. [2024-11-10 09:22:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:22:27,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-11-10 09:22:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:22:27,907 INFO L225 Difference]: With dead ends: 228 [2024-11-10 09:22:27,907 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 09:22:27,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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-10 09:22:27,909 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:22:27,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 483 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 14.8s Time] [2024-11-10 09:22:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 09:22:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-10 09:22:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:22:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2024-11-10 09:22:27,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 145 [2024-11-10 09:22:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:22:27,925 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2024-11-10 09:22:27,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:22:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2024-11-10 09:22:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 09:22:27,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:22:27,930 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:22:27,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 09:22:28,131 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-10 09:22:28,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:22:28,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:22:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1800321394, now seen corresponding path program 1 times [2024-11-10 09:22:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:22:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121743562] [2024-11-10 09:22:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:22:28,134 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-10 09:22:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:22:28,137 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-10 09:22:28,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process