./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:34:56,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:34:56,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:34:56,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:34:56,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:34:56,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:34:56,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:34:56,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:34:56,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:34:56,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:34:56,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:34:56,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:34:56,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:34:56,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:34:56,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:34:56,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:34:56,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:34:56,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:34:56,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:34:56,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:34:56,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:34:56,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:34:56,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:34:56,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:34:56,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:34:56,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:34:56,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:34:56,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:34:56,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:34:56,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:34:56,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:34:56,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:34:56,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:56,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:34:56,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:34:56,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:34:56,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:34:56,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:34:56,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:34:56,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:34:56,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:34:56,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:34:56,748 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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-19 00:34:57,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:34:57,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:34:57,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:34:57,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:34:57,040 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:34:57,041 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-38.i [2024-11-19 00:34:58,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:34:58,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:34:58,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-19 00:34:58,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d8e13e1/65cb2a308e2844eb881c9a10f94d8244/FLAGd04d332b5 [2024-11-19 00:34:59,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d8e13e1/65cb2a308e2844eb881c9a10f94d8244 [2024-11-19 00:34:59,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:34:59,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:34:59,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:59,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:34:59,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:34:59,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35587fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59, skipping insertion in model container [2024-11-19 00:34:59,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:34:59,294 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-38.i[916,929] [2024-11-19 00:34:59,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:59,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:34:59,432 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-38.i[916,929] [2024-11-19 00:34:59,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:34:59,490 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:34:59,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59 WrapperNode [2024-11-19 00:34:59,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:34:59,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:59,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:34:59,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:34:59,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,564 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-19 00:34:59,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:34:59,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:34:59,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:34:59,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:34:59,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,608 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-19 00:34:59,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:34:59,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:34:59,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:34:59,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:34:59,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (1/1) ... [2024-11-19 00:34:59,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:34:59,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:34:59,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:34:59,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:34:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:34:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:34:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:34:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:34:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:34:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:34:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:34:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:34:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:34:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:34:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:34:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:34:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:34:59,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:34:59,910 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:34:59,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:00,403 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:00,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:00,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:00,418 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:00,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:00 BoogieIcfgContainer [2024-11-19 00:35:00,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:00,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:00,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:00,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:00,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:34:59" (1/3) ... [2024-11-19 00:35:00,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faf61cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:00, skipping insertion in model container [2024-11-19 00:35:00,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:34:59" (2/3) ... [2024-11-19 00:35:00,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7faf61cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:00, skipping insertion in model container [2024-11-19 00:35:00,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:00" (3/3) ... [2024-11-19 00:35:00,426 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-19 00:35:00,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:00,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:00,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:00,519 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;@62680311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:00,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:00,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:00,537 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:00,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:00,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-19 00:35:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:00,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790113937] [2024-11-19 00:35:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-19 00:35:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790113937] [2024-11-19 00:35:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790113937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525461707] [2024-11-19 00:35:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:00,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:00,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:35:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:01,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:01,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-19 00:35:01,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525461707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:01,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:35:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921287981] [2024-11-19 00:35:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:01,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:01,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:01,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:01,351 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:35:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:01,385 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-19 00:35:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 00:35:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:01,393 INFO L225 Difference]: With dead ends: 237 [2024-11-19 00:35:01,393 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 00:35:01,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:01,400 INFO L432 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:01,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 00:35:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 00:35:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-19 00:35:01,443 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-19 00:35:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-19 00:35:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:35:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-19 00:35:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:01,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:01,452 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:01,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:35:01,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-19 00:35:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292577562] [2024-11-19 00:35:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292577562] [2024-11-19 00:35:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292577562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:02,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182937768] [2024-11-19 00:35:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:02,537 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:35:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:02,662 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-19 00:35:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-19 00:35:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:02,665 INFO L225 Difference]: With dead ends: 268 [2024-11-19 00:35:02,669 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 00:35:02,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:02,671 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:02,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 00:35:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-19 00:35:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-19 00:35:02,697 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-19 00:35:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:02,698 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-19 00:35:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:35:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-19 00:35:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:02,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:02,704 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:35:02,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-19 00:35:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911172124] [2024-11-19 00:35:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:07,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911172124] [2024-11-19 00:35:07,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911172124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:07,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:07,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:35:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194224873] [2024-11-19 00:35:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:07,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:35:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:35:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:35:07,125 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:35:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:09,139 INFO L93 Difference]: Finished difference Result 345 states and 501 transitions. [2024-11-19 00:35:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:35:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-19 00:35:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:09,144 INFO L225 Difference]: With dead ends: 345 [2024-11-19 00:35:09,146 INFO L226 Difference]: Without dead ends: 227 [2024-11-19 00:35:09,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:35:09,148 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 135 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2306 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 00:35:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-19 00:35:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2024-11-19 00:35:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 180 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:35:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-11-19 00:35:09,193 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 184 [2024-11-19 00:35:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:09,194 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-11-19 00:35:09,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 7.444444444444445) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:35:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-11-19 00:35:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:09,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:09,198 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:35:09,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1836943963, now seen corresponding path program 1 times [2024-11-19 00:35:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661096429] [2024-11-19 00:35:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:10,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661096429] [2024-11-19 00:35:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661096429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:35:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092317826] [2024-11-19 00:35:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:35:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:35:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:35:10,434 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 00:35:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:10,820 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2024-11-19 00:35:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:35:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-19 00:35:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:10,825 INFO L225 Difference]: With dead ends: 549 [2024-11-19 00:35:10,825 INFO L226 Difference]: Without dead ends: 328 [2024-11-19 00:35:10,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:10,827 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:10,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 687 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:35:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-19 00:35:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2024-11-19 00:35:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 261 states have internal predecessors, (349), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:35:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 473 transitions. [2024-11-19 00:35:10,869 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 473 transitions. Word has length 184 [2024-11-19 00:35:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:10,871 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 473 transitions. [2024-11-19 00:35:10,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 00:35:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 473 transitions. [2024-11-19 00:35:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:10,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:10,874 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:35:10,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2067786399, now seen corresponding path program 1 times [2024-11-19 00:35:10,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040226209] [2024-11-19 00:35:10,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040226209] [2024-11-19 00:35:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040226209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:35:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284414479] [2024-11-19 00:35:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:35:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:35:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:35:12,711 INFO L87 Difference]: Start difference. First operand 325 states and 473 transitions. Second operand has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:35:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:13,606 INFO L93 Difference]: Finished difference Result 711 states and 1035 transitions. [2024-11-19 00:35:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:35:13,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2024-11-19 00:35:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:13,611 INFO L225 Difference]: With dead ends: 711 [2024-11-19 00:35:13,612 INFO L226 Difference]: Without dead ends: 389 [2024-11-19 00:35:13,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:13,614 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 132 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:13,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2248 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:35:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-19 00:35:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 287. [2024-11-19 00:35:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 221 states have (on average 1.330316742081448) internal successors, (294), 223 states have internal predecessors, (294), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-19 00:35:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-19 00:35:13,654 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 184 [2024-11-19 00:35:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-19 00:35:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 9.571428571428571) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:35:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-19 00:35:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:13,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:13,659 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:13,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:35:13,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1031283231, now seen corresponding path program 1 times [2024-11-19 00:35:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842923339] [2024-11-19 00:35:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842923339] [2024-11-19 00:35:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842923339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:35:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468732161] [2024-11-19 00:35:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:14,894 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:35:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:15,496 INFO L93 Difference]: Finished difference Result 521 states and 751 transitions. [2024-11-19 00:35:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:35:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-19 00:35:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:15,499 INFO L225 Difference]: With dead ends: 521 [2024-11-19 00:35:15,499 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 00:35:15,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:35:15,503 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 138 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:15,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1576 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:35:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 00:35:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2024-11-19 00:35:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.3333333333333333) internal successors, (240), 181 states have internal predecessors, (240), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:35:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-11-19 00:35:15,540 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 184 [2024-11-19 00:35:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:15,542 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-11-19 00:35:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.166666666666666) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:35:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-11-19 00:35:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:15,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:15,544 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:35:15,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:15,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1618089245, now seen corresponding path program 1 times [2024-11-19 00:35:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414111688] [2024-11-19 00:35:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414111688] [2024-11-19 00:35:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414111688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:17,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:17,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:35:17,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4960626] [2024-11-19 00:35:17,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:17,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:35:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:35:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:35:17,144 INFO L87 Difference]: Start difference. First operand 226 states and 324 transitions. Second operand has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:35:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:17,854 INFO L93 Difference]: Finished difference Result 513 states and 737 transitions. [2024-11-19 00:35:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:35:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-19 00:35:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:17,858 INFO L225 Difference]: With dead ends: 513 [2024-11-19 00:35:17,858 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 00:35:17,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:35:17,860 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 132 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:17,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2182 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:35:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 00:35:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 201. [2024-11-19 00:35:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:35:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-19 00:35:17,891 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 184 [2024-11-19 00:35:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:17,893 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-19 00:35:17,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-19 00:35:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-19 00:35:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 00:35:17,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:17,895 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:35:17,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:17,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1729973726, now seen corresponding path program 1 times [2024-11-19 00:35:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:17,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790137269] [2024-11-19 00:35:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790137269] [2024-11-19 00:35:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790137269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:21,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:21,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:35:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469330917] [2024-11-19 00:35:21,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:21,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:35:21,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:35:21,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:21,568 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-19 00:35:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:23,398 INFO L93 Difference]: Finished difference Result 539 states and 760 transitions. [2024-11-19 00:35:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 00:35:23,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) Word has length 186 [2024-11-19 00:35:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:23,404 INFO L225 Difference]: With dead ends: 539 [2024-11-19 00:35:23,405 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 00:35:23,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:35:23,406 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 252 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:23,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2010 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:35:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 00:35:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 392. [2024-11-19 00:35:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 313 states have internal predecessors, (408), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-19 00:35:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 556 transitions. [2024-11-19 00:35:23,478 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 556 transitions. Word has length 186 [2024-11-19 00:35:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:23,479 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 556 transitions. [2024-11-19 00:35:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 15 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-19 00:35:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 556 transitions. [2024-11-19 00:35:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 00:35:23,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:23,482 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:23,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:35:23,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:23,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1049915356, now seen corresponding path program 1 times [2024-11-19 00:35:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225957732] [2024-11-19 00:35:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-19 00:35:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225957732] [2024-11-19 00:35:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225957732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591575889] [2024-11-19 00:35:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:24,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:24,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:24,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:35:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:25,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-19 00:35:25,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:25,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:25,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2024-11-19 00:35:25,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:35:25,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 00:35:25,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2024-11-19 00:35:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 15 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-19 00:35:25,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 174 proven. 24 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-19 00:35:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591575889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:35:26,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:35:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 18] total 39 [2024-11-19 00:35:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552077621] [2024-11-19 00:35:26,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:26,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 00:35:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 00:35:26,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 00:35:26,815 INFO L87 Difference]: Start difference. First operand 392 states and 556 transitions. Second operand has 39 states, 31 states have (on average 3.903225806451613) internal successors, (121), 37 states have internal predecessors, (121), 14 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (33), 8 states have call predecessors, (33), 14 states have call successors, (33) [2024-11-19 00:35:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:28,405 INFO L93 Difference]: Finished difference Result 663 states and 918 transitions. [2024-11-19 00:35:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 00:35:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 3.903225806451613) internal successors, (121), 37 states have internal predecessors, (121), 14 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (33), 8 states have call predecessors, (33), 14 states have call successors, (33) Word has length 186 [2024-11-19 00:35:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:28,409 INFO L225 Difference]: With dead ends: 663 [2024-11-19 00:35:28,409 INFO L226 Difference]: Without dead ends: 331 [2024-11-19 00:35:28,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=644, Invalid=2112, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 00:35:28,411 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2199 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 917 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2220 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 917 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:28,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2220 Valid, 1313 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [917 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:35:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-19 00:35:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 258. [2024-11-19 00:35:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 202 states have (on average 1.2673267326732673) internal successors, (256), 203 states have internal predecessors, (256), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 00:35:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 348 transitions. [2024-11-19 00:35:28,462 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 348 transitions. Word has length 186 [2024-11-19 00:35:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:28,463 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 348 transitions. [2024-11-19 00:35:28,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 3.903225806451613) internal successors, (121), 37 states have internal predecessors, (121), 14 states have call successors, (33), 4 states have call predecessors, (33), 9 states have return successors, (33), 8 states have call predecessors, (33), 14 states have call successors, (33) [2024-11-19 00:35:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2024-11-19 00:35:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 00:35:28,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:28,465 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:28,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:35:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 00:35:28,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:28,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1526935512, now seen corresponding path program 1 times [2024-11-19 00:35:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014127987] [2024-11-19 00:35:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:28,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:35:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:28,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:35:28,923 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:35:28,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:35:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:35:28,928 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:29,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:35:29,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:29 BoogieIcfgContainer [2024-11-19 00:35:29,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:35:29,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:35:29,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:35:29,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:35:29,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:00" (3/4) ... [2024-11-19 00:35:29,051 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:35:29,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:35:29,053 INFO L158 Benchmark]: Toolchain (without parser) took 29977.67ms. Allocated memory was 157.3MB in the beginning and 836.8MB in the end (delta: 679.5MB). Free memory was 89.7MB in the beginning and 315.4MB in the end (delta: -225.6MB). Peak memory consumption was 456.6MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,053 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:29,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.16ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 123.1MB in the end (delta: -33.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.74ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 118.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,054 INFO L158 Benchmark]: Boogie Preprocessor took 106.07ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 112.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,054 INFO L158 Benchmark]: RCFGBuilder took 745.94ms. Allocated memory is still 157.3MB. Free memory was 112.6MB in the beginning and 75.5MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,054 INFO L158 Benchmark]: TraceAbstraction took 28627.22ms. Allocated memory was 157.3MB in the beginning and 836.8MB in the end (delta: 679.5MB). Free memory was 74.9MB in the beginning and 315.4MB in the end (delta: -240.5MB). Peak memory consumption was 441.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:29,055 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 836.8MB. Free memory is still 315.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:29,056 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 113.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.16ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 123.1MB in the end (delta: -33.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.74ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 118.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.07ms. Allocated memory is still 157.3MB. Free memory was 118.3MB in the beginning and 112.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 745.94ms. Allocated memory is still 157.3MB. Free memory was 112.6MB in the beginning and 75.5MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28627.22ms. Allocated memory was 157.3MB in the beginning and 836.8MB in the end (delta: 679.5MB). Free memory was 74.9MB in the beginning and 315.4MB in the end (delta: -240.5MB). Peak memory consumption was 441.2MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 836.8MB. Free memory is still 315.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L58] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L59] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L61] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L64] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] double_Array_0[0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] double_Array_0[1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] double_Array_0[2] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[4] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L76] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] unsigned_short_int_Array_0[2][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR unsigned_short_int_Array_0[2][1] [L37] unsigned_short_int_Array_0[2][2] = (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]) [L38] EXPR unsigned_short_int_Array_0[1][2] [L38] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1][2]; [L39] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND FALSE !(unsigned_short_int_Array_0[2][1] > stepLocal_0) [L42] EXPR double_Array_0[1] [L42] EXPR double_Array_0[0] [L42] EXPR double_Array_0[2] [L42] EXPR double_Array_0[4] [L42] double_Array_0[3] = (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))) [L43] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L44] EXPR unsigned_short_int_Array_0[0][2] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[1][1] [L44] unsigned_short_int_Array_0[0][0] = (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])) [L52] EXPR BOOL_unsigned_char_Array_0[2] [L52] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[2]; [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] COND FALSE !((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && stepLocal_1) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_short_int_Array_0[2][2] [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) [L100] EXPR double_Array_0[3] [L100] EXPR double_Array_0[1] [L100] EXPR double_Array_0[0] [L100] EXPR double_Array_0[2] [L100] EXPR double_Array_0[4] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100-L101] return ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3219 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3176 mSDsluCounter, 13116 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11294 mSDsCounter, 974 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6082 IncrementalHoareTripleChecker+Invalid, 7056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 974 mSolverCounterUnsat, 1822 mSDtfsCounter, 6082 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 593 SyntacticMatches, 4 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 376 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9141 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1208 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 13145/13248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:35:29,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.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 bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:31,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:31,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:35:31,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:31,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:31,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:31,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:31,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:31,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:31,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:31,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:31,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:31,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:31,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:31,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:31,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:31,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:31,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:31,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:31,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:31,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:31,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:31,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:31,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:35:31,655 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:35:31,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:31,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:35:31,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:31,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:31,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:31,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:31,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:31,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:31,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:31,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:31,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:31,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:31,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:31,661 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:35:31,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:31,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:31,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:31,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:31,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:31,662 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 -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-19 00:35:32,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:32,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:32,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:32,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:32,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:32,060 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-38.i [2024-11-19 00:35:33,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:33,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:33,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-19 00:35:33,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c08e34b/1a9c7c65607c42d0936e44c2c505d80e/FLAG2ea3c9573 [2024-11-19 00:35:33,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c08e34b/1a9c7c65607c42d0936e44c2c505d80e [2024-11-19 00:35:33,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:33,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:33,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:33,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:33,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:33,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d000e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33, skipping insertion in model container [2024-11-19 00:35:33,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:34,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-19 00:35:34,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:34,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:34,214 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-38.i[916,929] [2024-11-19 00:35:34,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:34,299 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:34,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34 WrapperNode [2024-11-19 00:35:34,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:34,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:34,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:34,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:34,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,380 INFO L138 Inliner]: procedures = 36, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-19 00:35:34,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:34,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:34,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:34,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:34,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,446 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-19 00:35:34,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:34,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:34,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:34,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:34,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (1/1) ... [2024-11-19 00:35:34,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:34,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:35:34,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:35:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:35:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:35:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:35:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:35:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:35:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:35:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:35:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:35:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:34,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:34,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:35:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:35:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:35:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:35:34,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:35:34,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:35:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:35:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:35:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:35:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:35:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:35:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:35:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:35:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:35:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:35:34,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:34,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:37,978 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:37,979 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:37,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:37,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:37,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:37 BoogieIcfgContainer [2024-11-19 00:35:37,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:37,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:37,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:37,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:37,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:33" (1/3) ... [2024-11-19 00:35:37,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257eec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:37, skipping insertion in model container [2024-11-19 00:35:37,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:34" (2/3) ... [2024-11-19 00:35:37,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257eec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:37, skipping insertion in model container [2024-11-19 00:35:37,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:37" (3/3) ... [2024-11-19 00:35:37,999 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-19 00:35:38,016 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:38,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:38,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:38,090 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;@6b337e3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:38,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:38,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:38,113 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:38,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-19 00:35:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963641839] [2024-11-19 00:35:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:38,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-19 00:35:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:38,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:38,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:35:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:38,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:38,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-19 00:35:38,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:38,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:38,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963641839] [2024-11-19 00:35:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963641839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:38,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:35:38,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704022894] [2024-11-19 00:35:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:38,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:38,824 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:35:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:38,871 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-19 00:35:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:38,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 00:35:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:38,882 INFO L225 Difference]: With dead ends: 237 [2024-11-19 00:35:38,883 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 00:35:38,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:38,891 INFO L432 NwaCegarLoop]: 172 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, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:38,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 00:35:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 00:35:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-19 00:35:38,942 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-19 00:35:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-19 00:35:38,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:35:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-19 00:35:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:38,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:38,947 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:38,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:35:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:39,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-19 00:35:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589229210] [2024-11-19 00:35:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:39,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:39,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:39,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:39,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:35:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:39,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:35:39,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:35:39,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:39,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589229210] [2024-11-19 00:35:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589229210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670721340] [2024-11-19 00:35:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:39,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:39,808 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:35:42,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:35:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:42,554 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-19 00:35:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:42,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-19 00:35:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:42,560 INFO L225 Difference]: With dead ends: 268 [2024-11-19 00:35:42,560 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 00:35:42,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:42,562 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:42,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 00:35:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 00:35:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-19 00:35:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:35:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-19 00:35:42,581 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-19 00:35:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:42,583 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-19 00:35:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:35:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-19 00:35:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:42,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:42,587 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:42,604 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-19 00:35:42,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:42,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-19 00:35:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025171466] [2024-11-19 00:35:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:42,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:42,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:35:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:43,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 00:35:43,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:43,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:35:43,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:35:44,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-19 00:35:44,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:44,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-11-19 00:35:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 15 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-19 00:35:45,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:45,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025171466] [2024-11-19 00:35:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025171466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32798431] [2024-11-19 00:35:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:45,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:35:45,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:35:45,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-19 00:35:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:47,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:35:47,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:48,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:35:48,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 00:35:49,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-19 00:35:50,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-19 00:35:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-19 00:35:50,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 120 proven. 15 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-19 00:35:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [32798431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:35:51,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:35:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2024-11-19 00:35:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279059786] [2024-11-19 00:35:51,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:51,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 00:35:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 00:35:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 00:35:51,624 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) [2024-11-19 00:35:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:58,172 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2024-11-19 00:35:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 00:35:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) Word has length 184 [2024-11-19 00:35:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:58,176 INFO L225 Difference]: With dead ends: 365 [2024-11-19 00:35:58,176 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 00:35:58,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 546 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2024-11-19 00:35:58,179 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 917 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:58,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1497 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-19 00:35:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 00:35:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2024-11-19 00:35:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:35:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2024-11-19 00:35:58,233 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 184 [2024-11-19 00:35:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:58,235 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2024-11-19 00:35:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 5.366666666666666) internal successors, (161), 36 states have internal predecessors, (161), 16 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 9 states have call predecessors, (53), 16 states have call successors, (53) [2024-11-19 00:35:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2024-11-19 00:35:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:35:58,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:58,242 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:58,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:58,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:58,643 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:58,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2067786399, now seen corresponding path program 1 times [2024-11-19 00:35:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373495990] [2024-11-19 00:35:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:58,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:58,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:58,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:58,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:35:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:59,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:35:59,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:59,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:35:59,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:35:59,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 00:35:59,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:59,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-19 00:36:00,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:00,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2024-11-19 00:36:00,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 146 treesize of output 70 [2024-11-19 00:36:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2024-11-19 00:36:00,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:00,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373495990] [2024-11-19 00:36:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373495990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:36:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751365489] [2024-11-19 00:36:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:00,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:36:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:00,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:36:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:00,542 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:36:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:03,313 INFO L93 Difference]: Finished difference Result 623 states and 881 transitions. [2024-11-19 00:36:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:36:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-19 00:36:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:03,319 INFO L225 Difference]: With dead ends: 623 [2024-11-19 00:36:03,319 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 00:36:03,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:36:03,321 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 403 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:03,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 993 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 00:36:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 00:36:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 321. [2024-11-19 00:36:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 259 states have internal predecessors, (343), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 00:36:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2024-11-19 00:36:03,387 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 184 [2024-11-19 00:36:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:03,387 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2024-11-19 00:36:03,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:36:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2024-11-19 00:36:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:36:03,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:03,390 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:03,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:36:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:03,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1640374883, now seen corresponding path program 1 times [2024-11-19 00:36:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065847278] [2024-11-19 00:36:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:03,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:03,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:03,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:36:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:04,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:36:04,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:04,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:04,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 00:36:05,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-11-19 00:36:05,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 70 [2024-11-19 00:36:05,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 38 [2024-11-19 00:36:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 314 proven. 9 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-19 00:36:05,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:36:05,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:05,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065847278] [2024-11-19 00:36:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065847278] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-19 00:36:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571967104] [2024-11-19 00:36:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:05,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:36:05,756 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:36:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:06,238 INFO L93 Difference]: Finished difference Result 648 states and 915 transitions. [2024-11-19 00:36:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-19 00:36:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:06,242 INFO L225 Difference]: With dead ends: 648 [2024-11-19 00:36:06,242 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 00:36:06,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:36:06,246 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 139 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:06,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 617 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:36:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 00:36:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 319. [2024-11-19 00:36:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-19 00:36:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 450 transitions. [2024-11-19 00:36:06,286 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 450 transitions. Word has length 184 [2024-11-19 00:36:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 450 transitions. [2024-11-19 00:36:06,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:36:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 450 transitions. [2024-11-19 00:36:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 00:36:06,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:06,291 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:06,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:36:06,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:06,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:06,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1848931681, now seen corresponding path program 1 times [2024-11-19 00:36:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:06,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739466532] [2024-11-19 00:36:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:06,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:06,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process