./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:13:54,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:13:54,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:13:54,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:13:54,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:13:54,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:13:54,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:13:54,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:13:54,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:13:54,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:13:54,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:13:54,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:13:54,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:13:54,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:13:54,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:13:54,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:13:54,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:13:54,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:13:54,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:13:54,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:13:54,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:13:54,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:13:54,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:13:54,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:13:54,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:13:54,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:13:54,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:13:54,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:13:54,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:13:54,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:13:54,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:13:54,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:13:54,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:54,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:13:54,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:13:54,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:13:54,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:13:54,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:13:54,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:13:54,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:13:54,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:13:54,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:13:54,592 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2024-10-24 11:13:54,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:13:54,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:13:54,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:13:54,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:13:54,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:13:54,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:13:56,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:13:56,426 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:13:56,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:13:56,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6ba315c/f2652e6ef02e4db786a8e97e608df79b/FLAGa46fbcc67 [2024-10-24 11:13:56,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6ba315c/f2652e6ef02e4db786a8e97e608df79b [2024-10-24 11:13:56,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:13:56,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:13:56,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:56,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:13:56,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:13:56,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c5cc4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56, skipping insertion in model container [2024-10-24 11:13:56,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:13:56,628 WARN L248 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-20.i[916,929] [2024-10-24 11:13:56,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:56,708 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:13:56,720 WARN L248 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-20.i[916,929] [2024-10-24 11:13:56,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:13:56,783 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:13:56,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56 WrapperNode [2024-10-24 11:13:56,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:13:56,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:56,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:13:56,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:13:56,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,869 INFO L138 Inliner]: procedures = 29, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-24 11:13:56,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:13:56,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:13:56,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:13:56,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:13:56,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,925 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2024-10-24 11:13:56,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:13:56,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:13:56,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:13:56,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:13:56,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (1/1) ... [2024-10-24 11:13:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:13:56,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:13:57,004 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-10-24 11:13:57,007 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-10-24 11:13:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:13:57,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:13:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:13:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:13:57,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:13:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:13:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:13:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:13:57,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:13:57,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:13:57,678 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-24 11:13:57,678 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:13:57,704 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:13:57,704 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:13:57,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:57 BoogieIcfgContainer [2024-10-24 11:13:57,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:13:57,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:13:57,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:13:57,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:13:57,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:13:56" (1/3) ... [2024-10-24 11:13:57,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b7ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:57, skipping insertion in model container [2024-10-24 11:13:57,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:13:56" (2/3) ... [2024-10-24 11:13:57,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324b7ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:13:57, skipping insertion in model container [2024-10-24 11:13:57,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:57" (3/3) ... [2024-10-24 11:13:57,715 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:13:57,745 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:13:57,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:13:57,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:13:57,855 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;@9a4b2a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:13:57,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:13:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:13:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:13:57,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:57,875 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:57,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2071053727, now seen corresponding path program 1 times [2024-10-24 11:13:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644878227] [2024-10-24 11:13:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:13:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:13:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:13:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:13:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:13:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:13:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:13:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:13:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:13:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:13:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:13:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:13:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:13:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644878227] [2024-10-24 11:13:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644878227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:13:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252825567] [2024-10-24 11:13:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:58,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:13:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:13:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:13:58,231 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:13:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:58,283 INFO L93 Difference]: Finished difference Result 209 states and 337 transitions. [2024-10-24 11:13:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:13:58,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-24 11:13:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:58,295 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:13:58,295 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:13:58,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-24 11:13:58,302 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:58,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:13:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:13:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:13:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-24 11:13:58,350 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 147 [2024-10-24 11:13:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:58,351 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-24 11:13:58,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:13:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-24 11:13:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:13:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:58,357 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:58,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:13:58,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:58,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2010095469, now seen corresponding path program 1 times [2024-10-24 11:13:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444292759] [2024-10-24 11:13:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:13:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:13:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:13:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:13:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:13:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:13:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:13:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:13:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:13:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:13:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:13:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:13:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:13:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:13:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:13:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:13:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:13:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:13:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:13:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:13:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:13:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:13:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444292759] [2024-10-24 11:13:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444292759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:13:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:13:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:13:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413278608] [2024-10-24 11:13:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:13:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:13:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:13:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:13:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:58,708 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:13:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:13:58,773 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2024-10-24 11:13:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:13:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-24 11:13:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:13:58,775 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:13:58,775 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:13:58,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:13:58,776 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:13:58,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:13:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:13:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:13:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:13:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-10-24 11:13:58,789 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 147 [2024-10-24 11:13:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:13:58,791 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-10-24 11:13:58,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:13:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-10-24 11:13:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:13:58,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:13:58,795 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:13:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:13:58,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:13:58,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:13:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 23298577, now seen corresponding path program 1 times [2024-10-24 11:13:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:13:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130200105] [2024-10-24 11:13:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:13:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:13:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:13:58,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:13:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:13:59,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:13:59,103 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:13:59,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:13:59,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:13:59,108 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 11:13:59,181 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:13:59,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:13:59 BoogieIcfgContainer [2024-10-24 11:13:59,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:13:59,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:13:59,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:13:59,185 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:13:59,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:13:57" (3/4) ... [2024-10-24 11:13:59,187 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:13:59,187 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:13:59,188 INFO L158 Benchmark]: Toolchain (without parser) took 2734.96ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 52.2MB in the end (delta: 59.3MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,188 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:13:59,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.23ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 94.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.50ms. Allocated memory is still 180.4MB. Free memory was 94.6MB in the beginning and 90.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,192 INFO L158 Benchmark]: Boogie Preprocessor took 98.88ms. Allocated memory is still 180.4MB. Free memory was 90.3MB in the beginning and 85.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,192 INFO L158 Benchmark]: RCFGBuilder took 735.21ms. Allocated memory is still 180.4MB. Free memory was 85.0MB in the beginning and 116.0MB in the end (delta: -31.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,192 INFO L158 Benchmark]: TraceAbstraction took 1478.03ms. Allocated memory is still 180.4MB. Free memory was 115.1MB in the beginning and 52.2MB in the end (delta: 62.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-24 11:13:59,192 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 180.4MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:13:59,194 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.14ms. Allocated memory is still 180.4MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.23ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 94.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.50ms. Allocated memory is still 180.4MB. Free memory was 94.6MB in the beginning and 90.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.88ms. Allocated memory is still 180.4MB. Free memory was 90.3MB in the beginning and 85.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 735.21ms. Allocated memory is still 180.4MB. Free memory was 85.0MB in the beginning and 116.0MB in the end (delta: -31.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.03ms. Allocated memory is still 180.4MB. Free memory was 115.1MB in the beginning and 52.2MB in the end (delta: 62.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 180.4MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryArithmeticDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] 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}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] float_Array_0[3] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] RET updateVariables() [L111] CALL step() [L40] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE BOOL_unsigned_char_Array_0[1] [L41] EXPR float_Array_0[3] [L41] EXPR float_Array_0[2] [L41] EXPR float_Array_0[1] [L41] float_Array_0[4] = ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[3] [L45] EXPR double_Array_0[0] [L45] double_Array_0[1] = ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])) [L46] EXPR unsigned_long_int_Array_0[1][0] [L46] unsigned long int stepLocal_2 = unsigned_long_int_Array_0[1][0]; [L47] signed long int stepLocal_1 = 5; [L48] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L48] COND FALSE !(stepLocal_1 >= unsigned_long_int_Array_0[1][1]) [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[1]; [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND TRUE BOOL_unsigned_char_Array_0[0] || stepLocal_0 [L61] EXPR unsigned_long_int_Array_0[1][1] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[1] [L61] unsigned_long_int_Array_0[0][1] = ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) [L102] EXPR float_Array_0[4] [L102] EXPR float_Array_0[3] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[1] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) [L102] EXPR double_Array_0[1] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[3] [L102] EXPR double_Array_0[0] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102-L103] return (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 292 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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-10-24 11:13:59,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:14:01,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:14:01,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:14:01,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:14:01,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:14:01,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:14:01,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:14:01,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:14:01,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:14:01,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:14:01,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:14:01,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:14:01,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:14:01,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:14:01,385 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:14:01,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:14:01,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:14:01,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:14:01,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:14:01,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:14:01,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:14:01,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:14:01,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:14:01,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:14:01,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:14:01,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:14:01,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:14:01,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:14:01,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:14:01,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:14:01,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:14:01,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:14:01,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:14:01,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:14:01,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:01,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:14:01,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:14:01,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:14:01,393 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:14:01,393 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:14:01,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:14:01,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:14:01,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:14:01,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:14:01,396 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:14:01,396 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2024-10-24 11:14:01,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:14:01,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:14:01,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:14:01,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:14:01,693 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:14:01,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:14:03,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:14:03,356 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:14:03,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:14:03,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6b53a88/b121dcf6507e445ba7274d4791cb3dee/FLAGde23d2161 [2024-10-24 11:14:03,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6b53a88/b121dcf6507e445ba7274d4791cb3dee [2024-10-24 11:14:03,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:14:03,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:14:03,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:03,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:14:03,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:14:03,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:03" (1/1) ... [2024-10-24 11:14:03,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7ca68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:03, skipping insertion in model container [2024-10-24 11:14:03,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:03" (1/1) ... [2024-10-24 11:14:03,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:14:03,904 WARN L248 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-20.i[916,929] [2024-10-24 11:14:03,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:03,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:14:04,000 WARN L248 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-20.i[916,929] [2024-10-24 11:14:04,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:04,074 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:14:04,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04 WrapperNode [2024-10-24 11:14:04,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:04,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:04,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:14:04,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:14:04,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,142 INFO L138 Inliner]: procedures = 36, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-24 11:14:04,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:04,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:14:04,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:14:04,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:14:04,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,197 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2024-10-24 11:14:04,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:14:04,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:14:04,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:14:04,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:14:04,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (1/1) ... [2024-10-24 11:14:04,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:14:04,269 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-10-24 11:14:04,272 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-10-24 11:14:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:14:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:14:04,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:14:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:14:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:14:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:14:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:14:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:14:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:14:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:14:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:14:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:14:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:14:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:14:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:14:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:14:04,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:14:04,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:14:13,211 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-24 11:14:13,211 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:14:13,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:14:13,268 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:14:13,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:13 BoogieIcfgContainer [2024-10-24 11:14:13,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:14:13,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:14:13,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:14:13,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:14:13,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:14:03" (1/3) ... [2024-10-24 11:14:13,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfa9b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:13, skipping insertion in model container [2024-10-24 11:14:13,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:04" (2/3) ... [2024-10-24 11:14:13,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfa9b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:13, skipping insertion in model container [2024-10-24 11:14:13,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:13" (3/3) ... [2024-10-24 11:14:13,275 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2024-10-24 11:14:13,287 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:14:13,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:14:13,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:14:13,350 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;@73b8b8f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:14:13,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:14:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:14:13,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:13,366 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:13,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2071053727, now seen corresponding path program 1 times [2024-10-24 11:14:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745017917] [2024-10-24 11:14:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:13,389 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-10-24 11:14:13,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:13,392 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-10-24 11:14:13,394 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-10-24 11:14:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:14,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:14:14,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-10-24 11:14:14,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:14,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745017917] [2024-10-24 11:14:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745017917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:14:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905650409] [2024-10-24 11:14:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:14,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:14:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:14:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:14:14,192 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:14,264 INFO L93 Difference]: Finished difference Result 209 states and 337 transitions. [2024-10-24 11:14:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:14:14,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-24 11:14:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:14,274 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:14:14,274 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:14:14,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-10-24 11:14:14,280 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:14,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:14:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:14:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-24 11:14:14,331 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 147 [2024-10-24 11:14:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-24 11:14:14,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-24 11:14:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:14:14,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:14,336 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:14,359 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-10-24 11:14:14,540 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-10-24 11:14:14,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2010095469, now seen corresponding path program 1 times [2024-10-24 11:14:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217048485] [2024-10-24 11:14:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:14,543 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-10-24 11:14:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:14,545 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-10-24 11:14:14,547 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-10-24 11:14:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:15,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:14:15,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-24 11:14:15,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:15,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217048485] [2024-10-24 11:14:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217048485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:14:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047119740] [2024-10-24 11:14:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:14:15,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:15,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:14:15,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:15,302 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:15,396 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2024-10-24 11:14:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:14:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-24 11:14:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:15,398 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:14:15,398 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:14:15,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:15,399 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:15,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:14:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:14:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-10-24 11:14:15,412 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 147 [2024-10-24 11:14:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-10-24 11:14:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-10-24 11:14:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:14:15,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:15,415 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:15,440 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-10-24 11:14:15,619 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-10-24 11:14:15,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 23298577, now seen corresponding path program 1 times [2024-10-24 11:14:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806363299] [2024-10-24 11:14:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:15,622 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-10-24 11:14:15,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:15,623 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-10-24 11:14:15,625 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-10-24 11:14:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:16,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:16,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:16,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-10-24 11:14:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-24 11:14:16,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:16,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806363299] [2024-10-24 11:14:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806363299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681067250] [2024-10-24 11:14:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:16,691 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:20,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:25,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:25,532 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2024-10-24 11:14:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:14:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-24 11:14:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:25,538 INFO L225 Difference]: With dead ends: 212 [2024-10-24 11:14:25,538 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 11:14:25,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:14:25,539 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 133 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:25,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 423 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-10-24 11:14:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 11:14:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-24 11:14:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-10-24 11:14:25,548 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 147 [2024-10-24 11:14:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:25,548 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-10-24 11:14:25,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-10-24 11:14:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 11:14:25,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:25,550 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:25,576 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-10-24 11:14:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:25,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash -543203627, now seen corresponding path program 1 times [2024-10-24 11:14:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:25,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917211107] [2024-10-24 11:14:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:25,757 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-10-24 11:14:25,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:25,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:25,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:14:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:26,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:14:26,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-24 11:14:26,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:26,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:26,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917211107] [2024-10-24 11:14:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917211107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:26,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:14:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146411395] [2024-10-24 11:14:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:26,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:26,570 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 11:14:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:27,288 INFO L93 Difference]: Finished difference Result 215 states and 308 transitions. [2024-10-24 11:14:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:14:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2024-10-24 11:14:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:27,294 INFO L225 Difference]: With dead ends: 215 [2024-10-24 11:14:27,294 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:14:27,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:27,295 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:27,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:14:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:14:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2024-10-24 11:14:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-24 11:14:27,320 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 149 [2024-10-24 11:14:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-24 11:14:27,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 11:14:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-24 11:14:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 11:14:27,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:27,324 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:27,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:14:27,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:27,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 549431575, now seen corresponding path program 1 times [2024-10-24 11:14:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738761039] [2024-10-24 11:14:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:27,542 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-10-24 11:14:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:27,544 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-10-24 11:14:27,545 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-10-24 11:14:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:28,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:28,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:14:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-24 11:14:28,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:28,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738761039] [2024-10-24 11:14:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738761039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831786246] [2024-10-24 11:14:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:28,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:28,920 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:34,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:35,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:40,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:40,502 INFO L93 Difference]: Finished difference Result 211 states and 301 transitions. [2024-10-24 11:14:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:14:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-10-24 11:14:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:40,508 INFO L225 Difference]: With dead ends: 211 [2024-10-24 11:14:40,508 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:14:40,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:14:40,509 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 119 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:40,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 410 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2024-10-24 11:14:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:14:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-10-24 11:14:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2024-10-24 11:14:40,516 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 149 [2024-10-24 11:14:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:40,516 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2024-10-24 11:14:40,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:14:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2024-10-24 11:14:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:14:40,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:40,518 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:40,543 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-10-24 11:14:40,721 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-10-24 11:14:40,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:40,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1265238369, now seen corresponding path program 1 times [2024-10-24 11:14:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472440511] [2024-10-24 11:14:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:40,724 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-10-24 11:14:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:40,727 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-10-24 11:14:40,729 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-10-24 11:14:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:41,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:14:41,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-10-24 11:14:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 24 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-24 11:14:42,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-24 11:14:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 11:14:42,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:42,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472440511] [2024-10-24 11:14:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472440511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:14:42,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:14:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:14:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019104004] [2024-10-24 11:14:42,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:14:42,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:14:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:14:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:14:42,741 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-24 11:14:47,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:53,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:55,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:14:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:55,898 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2024-10-24 11:14:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:14:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 151 [2024-10-24 11:14:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:55,904 INFO L225 Difference]: With dead ends: 220 [2024-10-24 11:14:55,904 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:14:55,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:14:55,905 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 126 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:55,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 566 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 12.6s Time] [2024-10-24 11:14:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:14:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-10-24 11:14:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:14:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-10-24 11:14:55,930 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 151 [2024-10-24 11:14:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:55,931 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-10-24 11:14:55,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-24 11:14:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-10-24 11:14:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:14:55,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:55,932 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:14:55,958 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-10-24 11:14:56,132 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-10-24 11:14:56,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1383679843, now seen corresponding path program 1 times [2024-10-24 11:14:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998051575] [2024-10-24 11:14:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:56,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-10-24 11:14:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:56,135 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-10-24 11:14:56,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:14:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:56,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:56,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:57,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:14:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-10-24 11:14:57,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:57,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998051575] [2024-10-24 11:14:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998051575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404834496] [2024-10-24 11:14:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:57,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:57,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:57,381 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:15:02,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:05,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:09,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:13,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:13,572 INFO L93 Difference]: Finished difference Result 208 states and 292 transitions. [2024-10-24 11:15:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:15:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:15:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:13,579 INFO L225 Difference]: With dead ends: 208 [2024-10-24 11:15:13,579 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:15:13,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:15:13,580 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 107 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 400 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 16.1s Time] [2024-10-24 11:15:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:15:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-24 11:15:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:15:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-10-24 11:15:13,597 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 151 [2024-10-24 11:15:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:13,597 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-10-24 11:15:13,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:15:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-10-24 11:15:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:15:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:13,605 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:15:13,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:15:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:13,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 981053655, now seen corresponding path program 1 times [2024-10-24 11:15:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583883156] [2024-10-24 11:15:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:13,808 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-10-24 11:15:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:13,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:13,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:15:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:14,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:15:14,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:15,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-10-24 11:15:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-24 11:15:15,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:15,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583883156] [2024-10-24 11:15:15,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583883156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:15,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:15,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:15:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138579409] [2024-10-24 11:15:15,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:15,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:15,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:15,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:15,168 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:15:18,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:23,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:15:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:24,149 INFO L93 Difference]: Finished difference Result 208 states and 290 transitions. [2024-10-24 11:15:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:15:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-24 11:15:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:24,155 INFO L225 Difference]: With dead ends: 208 [2024-10-24 11:15:24,155 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:15:24,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:15:24,156 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:24,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 394 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2024-10-24 11:15:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:15:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-24 11:15:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:15:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-10-24 11:15:24,166 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 153 [2024-10-24 11:15:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:24,169 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-10-24 11:15:24,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:15:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-10-24 11:15:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:15:24,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:24,170 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:15:24,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:15:24,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:24,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1989083741, now seen corresponding path program 1 times [2024-10-24 11:15:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96008779] [2024-10-24 11:15:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:24,375 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-10-24 11:15:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:24,378 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:24,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process