./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:13:25,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:13:25,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:13:25,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:13:25,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:13:25,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:13:25,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:13:25,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:13:25,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:13:25,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:13:25,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:13:25,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:13:25,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:13:25,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:13:25,500 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:13:25,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:13:25,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:13:25,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:13:25,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:13:25,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:13:25,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:13:25,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:13:25,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:13:25,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:13:25,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:13:25,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:13:25,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:13:25,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:13:25,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:13:25,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:13:25,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:13:25,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:13:25,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:13:25,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:13:25,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:13:25,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:13:25,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:13:25,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:13:25,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:13:25,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:13:25,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:13:25,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:13:25,511 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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2024-11-10 09:13:25,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:13:25,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:13:25,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:13:25,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:13:25,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:13:25,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:27,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:13:27,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:13:27,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:27,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ad74267/5bbbf30787e14a2ebc5a272b6c9fc8f0/FLAG41a87adc7 [2024-11-10 09:13:27,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ad74267/5bbbf30787e14a2ebc5a272b6c9fc8f0 [2024-11-10 09:13:27,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:13:27,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:13:27,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:13:27,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:13:27,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:13:27,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:27" (1/1) ... [2024-11-10 09:13:27,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f20d571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:27, skipping insertion in model container [2024-11-10 09:13:27,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:27" (1/1) ... [2024-11-10 09:13:27,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:13:27,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i[916,929] [2024-11-10 09:13:27,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:13:28,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:13:28,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i[916,929] [2024-11-10 09:13:28,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:13:28,098 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:13:28,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28 WrapperNode [2024-11-10 09:13:28,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:13:28,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:13:28,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:13:28,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:13:28,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,169 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-11-10 09:13:28,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:13:28,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:13:28,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:13:28,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:13:28,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,217 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-10 09:13:28,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:13:28,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:13:28,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:13:28,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:13:28,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (1/1) ... [2024-11-10 09:13:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:13:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:13:28,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:13:28,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:13:28,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:13:28,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:13:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:13:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:13:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:13:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:13:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:13:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:13:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:13:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:13:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:13:28,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:13:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:13:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:13:28,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:13:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:13:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:13:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:13:28,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:13:28,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:13:28,558 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:13:28,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:13:29,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 09:13:29,122 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-10 09:13:29,122 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:13:29,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:13:29,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:13:29,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:13:29 BoogieIcfgContainer [2024-11-10 09:13:29,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:13:29,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:13:29,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:13:29,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:13:29,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:13:27" (1/3) ... [2024-11-10 09:13:29,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47dbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:29, skipping insertion in model container [2024-11-10 09:13:29,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:28" (2/3) ... [2024-11-10 09:13:29,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c47dbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:29, skipping insertion in model container [2024-11-10 09:13:29,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:13:29" (3/3) ... [2024-11-10 09:13:29,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:29,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:13:29,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:13:29,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:13:29,241 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;@14408119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:13:29,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:13:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:29,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:29,263 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:29,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1407874430, now seen corresponding path program 1 times [2024-11-10 09:13:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985239585] [2024-11-10 09:13:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:13:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:13:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:13:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:13:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:13:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:13:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:13:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:13:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:13:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:13:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985239585] [2024-11-10 09:13:29,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985239585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:29,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:29,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:13:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444949568] [2024-11-10 09:13:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:13:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:13:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:13:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:13:29,750 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:29,774 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-11-10 09:13:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:13:29,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-10 09:13:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:29,783 INFO L225 Difference]: With dead ends: 184 [2024-11-10 09:13:29,783 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:13:29,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:13:29,789 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:29,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:13:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:13:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:13:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-10 09:13:29,832 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 91 [2024-11-10 09:13:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-10 09:13:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-10 09:13:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:29,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:29,837 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:29,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:13:29,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -349728919, now seen corresponding path program 1 times [2024-11-10 09:13:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440163685] [2024-11-10 09:13:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:13:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:13:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:13:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:13:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:13:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:13:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:13:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:13:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:13:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:13:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440163685] [2024-11-10 09:13:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440163685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:13:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960255979] [2024-11-10 09:13:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:13:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:13:30,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:13:30,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:30,173 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:30,217 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2024-11-10 09:13:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:13:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-10 09:13:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:30,219 INFO L225 Difference]: With dead ends: 181 [2024-11-10 09:13:30,220 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 09:13:30,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:30,222 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:30,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:13:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 09:13:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 09:13:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-10 09:13:30,238 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 91 [2024-11-10 09:13:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:30,239 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-10 09:13:30,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-10 09:13:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:30,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:30,243 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:30,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:13:30,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1458544118, now seen corresponding path program 1 times [2024-11-10 09:13:30,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:30,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110707981] [2024-11-10 09:13:30,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:13:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:13:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:13:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:13:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:13:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:13:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:13:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:13:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:13:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:30,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:13:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110707981] [2024-11-10 09:13:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110707981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:13:30,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158162984] [2024-11-10 09:13:30,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:30,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:13:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:13:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:13:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:30,564 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:30,607 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2024-11-10 09:13:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:13:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-10 09:13:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:30,610 INFO L225 Difference]: With dead ends: 186 [2024-11-10 09:13:30,610 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:13:30,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:30,611 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:30,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 369 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:13:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:13:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-10 09:13:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2024-11-10 09:13:30,632 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 91 [2024-11-10 09:13:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:30,632 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2024-11-10 09:13:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2024-11-10 09:13:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:30,635 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:13:30,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:30,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1429914967, now seen corresponding path program 1 times [2024-11-10 09:13:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968823535] [2024-11-10 09:13:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:30,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:13:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:13:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:13:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:13:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:13:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:13:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:13:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:13:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:13:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:13:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968823535] [2024-11-10 09:13:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968823535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682733338] [2024-11-10 09:13:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:30,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:13:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:30,947 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:31,048 INFO L93 Difference]: Finished difference Result 187 states and 263 transitions. [2024-11-10 09:13:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-10 09:13:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:31,050 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:13:31,050 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 09:13:31,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:31,052 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:31,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:13:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 09:13:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 09:13:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-10 09:13:31,063 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 91 [2024-11-10 09:13:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:31,063 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-10 09:13:31,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-10 09:13:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:31,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:31,067 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:13:31,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:31,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1218564054, now seen corresponding path program 1 times [2024-11-10 09:13:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756548192] [2024-11-10 09:13:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:13:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:13:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:13:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:13:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:13:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:13:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:13:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:13:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:13:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:13:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756548192] [2024-11-10 09:13:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756548192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186752630] [2024-11-10 09:13:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:31,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:13:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:31,342 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:31,421 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2024-11-10 09:13:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-10 09:13:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:31,423 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:13:31,423 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 09:13:31,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:31,427 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:31,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:13:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 09:13:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 09:13:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-11-10 09:13:31,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 91 [2024-11-10 09:13:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-11-10 09:13:31,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-11-10 09:13:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:31,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:31,440 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:31,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:13:31,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash 288987755, now seen corresponding path program 1 times [2024-11-10 09:13:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:13:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481211223] [2024-11-10 09:13:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:13:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:13:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423285408] [2024-11-10 09:13:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:13:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:13:31,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:13:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:13:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:13:32,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:13:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:13:32,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:13:32,350 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:13:32,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:13:32,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:32,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 09:13:32,563 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 09:13:32,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:13:32,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:13:32 BoogieIcfgContainer [2024-11-10 09:13:32,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:13:32,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:13:32,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:13:32,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:13:32,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:13:29" (3/4) ... [2024-11-10 09:13:32,675 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:13:32,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:13:32,681 INFO L158 Benchmark]: Toolchain (without parser) took 5025.69ms. Allocated memory is still 218.1MB. Free memory was 160.4MB in the beginning and 99.5MB in the end (delta: 60.9MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,681 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:13:32,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 218.1MB. Free memory was 160.1MB in the beginning and 143.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.32ms. Allocated memory is still 218.1MB. Free memory was 143.3MB in the beginning and 138.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,685 INFO L158 Benchmark]: Boogie Preprocessor took 84.34ms. Allocated memory is still 218.1MB. Free memory was 138.7MB in the beginning and 133.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,685 INFO L158 Benchmark]: IcfgBuilder took 879.60ms. Allocated memory is still 218.1MB. Free memory was 133.4MB in the beginning and 179.5MB in the end (delta: -46.1MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,686 INFO L158 Benchmark]: TraceAbstraction took 3530.70ms. Allocated memory is still 218.1MB. Free memory was 178.5MB in the beginning and 99.5MB in the end (delta: 79.0MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-11-10 09:13:32,686 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 218.1MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:13:32,687 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.25ms. Allocated memory is still 138.4MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 218.1MB. Free memory was 160.1MB in the beginning and 143.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.32ms. Allocated memory is still 218.1MB. Free memory was 143.3MB in the beginning and 138.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.34ms. Allocated memory is still 218.1MB. Free memory was 138.7MB in the beginning and 133.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 879.60ms. Allocated memory is still 218.1MB. Free memory was 133.4MB in the beginning and 179.5MB in the end (delta: -46.1MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3530.70ms. Allocated memory is still 218.1MB. Free memory was 178.5MB in the beginning and 99.5MB in the end (delta: 79.0MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 218.1MB. Free memory is still 99.5MB. 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 76, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 64; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] EXPR unsigned_char_Array_0[1] [L73] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L57] float_Array_0[0][1] = __VERIFIER_nondet_float() [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] float_Array_0[1][1] = __VERIFIER_nondet_float() [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] CALL assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] RET assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L61] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L62] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L65] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L66] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET updateVariables() [L85] CALL step() [L41] EXPR float_Array_0[0][1] [L41] EXPR float_Array_0[1][1] [L41] float_Array_0[1][0] = ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]) [L42] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L42] COND TRUE (- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4)))) [L43] EXPR unsigned_char_Array_0[0] [L43] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L45] EXPR float_Array_0[0][1] [L45] float_Array_0[0][0] = float_Array_0[0][1] [L46] EXPR float_Array_0[0][0] [L46] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND TRUE float_Array_0[0][0] > float_Array_0[0][0] [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] signed_short_int_Array_0[1] = ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_short_int_Array_0[1] [L51] signed long int stepLocal_0 = unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1]); [L52] EXPR unsigned_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) [L85] RET step() [L86] CALL, EXPR property() [L76] EXPR float_Array_0[0][0] [L76] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) [L76] EXPR signed_short_int_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) [L76] EXPR float_Array_0[1][0] [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[1][1] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76-L77] return (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 635 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 720/720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:13:32,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:13:35,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:13:35,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:13:35,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:13:35,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:13:35,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:13:35,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:13:35,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:13:35,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:13:35,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:13:35,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:13:35,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:13:35,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:13:35,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:13:35,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:13:35,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:13:35,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:13:35,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:13:35,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:13:35,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:13:35,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:13:35,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:13:35,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:13:35,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:13:35,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:13:35,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:13:35,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:13:35,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:13:35,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:13:35,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:13:35,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:13:35,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:13:35,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:13:35,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:13:35,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:13:35,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:13:35,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:13:35,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:13:35,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:13:35,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:13:35,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:13:35,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:13:35,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:13:35,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:13:35,142 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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2024-11-10 09:13:35,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:13:35,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:13:35,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:13:35,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:13:35,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:13:35,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:37,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:13:37,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:13:37,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:37,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693e03b34/4da97a29eef047718631e10e43a3994d/FLAG843b530c6 [2024-11-10 09:13:37,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693e03b34/4da97a29eef047718631e10e43a3994d [2024-11-10 09:13:37,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:13:37,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:13:37,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:13:37,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:13:37,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:13:37,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:37" (1/1) ... [2024-11-10 09:13:37,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3380e38f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:37, skipping insertion in model container [2024-11-10 09:13:37,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:13:37" (1/1) ... [2024-11-10 09:13:37,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:13:37,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i[916,929] [2024-11-10 09:13:38,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:13:38,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:13:38,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i[916,929] [2024-11-10 09:13:38,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:13:38,126 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:13:38,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38 WrapperNode [2024-11-10 09:13:38,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:13:38,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:13:38,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:13:38,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:13:38,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,191 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-11-10 09:13:38,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:13:38,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:13:38,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:13:38,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:13:38,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,248 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-10 09:13:38,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:13:38,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:13:38,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:13:38,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:13:38,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (1/1) ... [2024-11-10 09:13:38,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:13:38,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:13:38,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:13:38,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:13:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:13:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:13:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:13:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 09:13:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 09:13:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 09:13:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-10 09:13:38,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-10 09:13:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:13:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:13:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-10 09:13:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-10 09:13:38,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-10 09:13:38,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-10 09:13:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:13:38,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:13:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:13:38,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:13:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:13:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:13:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 09:13:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-10 09:13:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 09:13:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-10 09:13:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-10 09:13:38,596 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:13:38,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:13:39,829 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 09:13:39,882 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-10 09:13:39,883 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:13:39,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:13:39,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:13:39,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:13:39 BoogieIcfgContainer [2024-11-10 09:13:39,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:13:39,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:13:39,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:13:39,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:13:39,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:13:37" (1/3) ... [2024-11-10 09:13:39,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e070e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:39, skipping insertion in model container [2024-11-10 09:13:39,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:13:38" (2/3) ... [2024-11-10 09:13:39,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e070e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:13:39, skipping insertion in model container [2024-11-10 09:13:39,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:13:39" (3/3) ... [2024-11-10 09:13:39,915 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2024-11-10 09:13:39,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:13:39,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:13:39,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:13:40,005 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;@2282d718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:13:40,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:13:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:40,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:40,020 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:40,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:40,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1407874430, now seen corresponding path program 1 times [2024-11-10 09:13:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762951261] [2024-11-10 09:13:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:40,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:40,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:40,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:13:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:40,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:13:40,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-10 09:13:40,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:40,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762951261] [2024-11-10 09:13:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762951261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:13:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863067377] [2024-11-10 09:13:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:40,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:13:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:13:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:13:40,566 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:40,592 INFO L93 Difference]: Finished difference Result 184 states and 276 transitions. [2024-11-10 09:13:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:13:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-10 09:13:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:40,600 INFO L225 Difference]: With dead ends: 184 [2024-11-10 09:13:40,600 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 09:13:40,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:13:40,607 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:40,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:13:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 09:13:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 09:13:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-10 09:13:40,646 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 91 [2024-11-10 09:13:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:40,647 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-10 09:13:40,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-10 09:13:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:40,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:40,652 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:40,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:13:40,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:40,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash -349728919, now seen corresponding path program 1 times [2024-11-10 09:13:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435599801] [2024-11-10 09:13:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:40,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:40,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:40,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:40,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:13:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:41,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:13:41,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 09:13:41,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:41,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435599801] [2024-11-10 09:13:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435599801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:13:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827421996] [2024-11-10 09:13:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:13:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:41,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:13:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:41,303 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:41,567 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2024-11-10 09:13:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:13:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-10 09:13:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:41,578 INFO L225 Difference]: With dead ends: 181 [2024-11-10 09:13:41,578 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 09:13:41,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:13:41,580 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:41,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:13:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 09:13:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 09:13:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-10 09:13:41,590 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 91 [2024-11-10 09:13:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-10 09:13:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 09:13:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-10 09:13:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:41,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:41,594 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:41,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:41,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:41,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1458544118, now seen corresponding path program 1 times [2024-11-10 09:13:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256541569] [2024-11-10 09:13:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:41,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:13:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:42,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:13:42,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:42,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:42,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256541569] [2024-11-10 09:13:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256541569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:42,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:13:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923971948] [2024-11-10 09:13:42,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:42,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:13:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:13:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:13:42,225 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:42,315 INFO L93 Difference]: Finished difference Result 188 states and 266 transitions. [2024-11-10 09:13:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:13:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-10 09:13:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:42,320 INFO L225 Difference]: With dead ends: 188 [2024-11-10 09:13:42,320 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 09:13:42,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:13:42,323 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:42,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:13:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 09:13:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-10 09:13:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2024-11-10 09:13:42,339 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 91 [2024-11-10 09:13:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:42,340 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2024-11-10 09:13:42,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2024-11-10 09:13:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:13:42,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:42,343 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:42,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:42,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:42,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1429914967, now seen corresponding path program 1 times [2024-11-10 09:13:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980829406] [2024-11-10 09:13:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:42,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:42,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:13:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:42,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:13:42,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:43,024 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-11-10 09:13:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:43,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:43,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980829406] [2024-11-10 09:13:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980829406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:13:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024376000] [2024-11-10 09:13:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:43,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:13:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:13:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:13:43,084 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:43,883 INFO L93 Difference]: Finished difference Result 192 states and 268 transitions. [2024-11-10 09:13:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:13:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-10 09:13:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:43,886 INFO L225 Difference]: With dead ends: 192 [2024-11-10 09:13:43,886 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 09:13:43,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:13:43,889 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 442 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:13:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 09:13:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-10 09:13:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2024-11-10 09:13:43,905 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 91 [2024-11-10 09:13:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:43,906 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2024-11-10 09:13:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-10 09:13:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:13:43,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:43,908 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:43,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 09:13:44,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:44,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1336881767, now seen corresponding path program 1 times [2024-11-10 09:13:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023672424] [2024-11-10 09:13:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:44,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:44,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:44,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:44,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 09:13:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:44,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:13:44,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:44,505 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 21 treesize of output 9 [2024-11-10 09:13:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:44,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:44,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023672424] [2024-11-10 09:13:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023672424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885931670] [2024-11-10 09:13:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:44,549 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:44,766 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2024-11-10 09:13:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-10 09:13:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:44,769 INFO L225 Difference]: With dead ends: 191 [2024-11-10 09:13:44,770 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 09:13:44,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:44,773 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:44,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:13:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 09:13:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 09:13:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-10 09:13:44,787 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 93 [2024-11-10 09:13:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:44,788 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-10 09:13:44,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-10 09:13:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:13:44,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:44,790 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:44,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:44,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:44,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:44,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1548232680, now seen corresponding path program 1 times [2024-11-10 09:13:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069242367] [2024-11-10 09:13:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:44,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:44,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 09:13:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:45,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:13:45,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:45,436 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 21 treesize of output 9 [2024-11-10 09:13:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:45,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:45,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069242367] [2024-11-10 09:13:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069242367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127250610] [2024-11-10 09:13:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:45,465 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:45,491 INFO L93 Difference]: Finished difference Result 191 states and 263 transitions. [2024-11-10 09:13:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-10 09:13:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:45,493 INFO L225 Difference]: With dead ends: 191 [2024-11-10 09:13:45,493 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 09:13:45,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:45,495 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:45,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:13:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 09:13:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 09:13:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 132 transitions. [2024-11-10 09:13:45,503 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 132 transitions. Word has length 93 [2024-11-10 09:13:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:45,503 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 132 transitions. [2024-11-10 09:13:45,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2024-11-10 09:13:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:13:45,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:45,505 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:45,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:45,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:45,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1239182807, now seen corresponding path program 1 times [2024-11-10 09:13:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011244184] [2024-11-10 09:13:45,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:45,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:45,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:45,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:45,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 09:13:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:46,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:13:46,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:46,098 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 43 treesize of output 19 [2024-11-10 09:13:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:46,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:46,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011244184] [2024-11-10 09:13:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011244184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433444730] [2024-11-10 09:13:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:46,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:46,127 INFO L87 Difference]: Start difference. First operand 97 states and 132 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:46,453 INFO L93 Difference]: Finished difference Result 189 states and 259 transitions. [2024-11-10 09:13:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:46,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-10 09:13:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:46,455 INFO L225 Difference]: With dead ends: 189 [2024-11-10 09:13:46,455 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 09:13:46,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:46,456 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 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.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:46,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:13:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 09:13:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 09:13:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-10 09:13:46,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 93 [2024-11-10 09:13:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:46,468 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-10 09:13:46,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-10 09:13:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:13:46,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:46,470 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:46,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 09:13:46,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:46,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:46,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1844835160, now seen corresponding path program 1 times [2024-11-10 09:13:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138881884] [2024-11-10 09:13:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:46,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:46,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 09:13:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:47,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:13:47,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:47,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:47,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138881884] [2024-11-10 09:13:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138881884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772114218] [2024-11-10 09:13:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:47,051 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:47,503 INFO L93 Difference]: Finished difference Result 187 states and 255 transitions. [2024-11-10 09:13:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-10 09:13:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:47,506 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:13:47,507 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 09:13:47,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:47,508 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:47,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:13:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 09:13:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 09:13:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-11-10 09:13:47,520 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 98 [2024-11-10 09:13:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:47,520 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-11-10 09:13:47,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-11-10 09:13:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:13:47,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:47,522 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:47,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:47,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:47,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1813815353, now seen corresponding path program 1 times [2024-11-10 09:13:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119415042] [2024-11-10 09:13:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:47,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-11-10 09:13:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:47,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:47,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 09:13:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:48,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:13:48,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:48,112 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 21 treesize of output 9 [2024-11-10 09:13:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:48,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:48,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119415042] [2024-11-10 09:13:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119415042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:48,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:13:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057770029] [2024-11-10 09:13:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:48,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:13:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:13:48,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:48,136 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:48,440 INFO L93 Difference]: Finished difference Result 187 states and 253 transitions. [2024-11-10 09:13:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:13:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-10 09:13:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:48,442 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:13:48,442 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 09:13:48,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:13:48,443 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:48,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:13:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 09:13:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 09:13:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 09:13:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-11-10 09:13:48,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 98 [2024-11-10 09:13:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:48,448 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-11-10 09:13:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-10 09:13:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:13:48,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:48,450 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:48,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:48,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:48,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:48,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash 443095654, now seen corresponding path program 1 times [2024-11-10 09:13:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:48,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261410548] [2024-11-10 09:13:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:48,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:48,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:48,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 09:13:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:49,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:13:49,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:49,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-10 09:13:49,362 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 41 treesize of output 29 [2024-11-10 09:13:49,429 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 69 treesize of output 33 [2024-11-10 09:13:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:13:49,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:13:49,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:13:49,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261410548] [2024-11-10 09:13:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261410548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:13:49,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:13:49,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:13:49,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095455506] [2024-11-10 09:13:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:13:49,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:13:49,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:13:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:13:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:13:49,601 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:13:52,305 INFO L93 Difference]: Finished difference Result 282 states and 378 transitions. [2024-11-10 09:13:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 09:13:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-10 09:13:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:13:52,307 INFO L225 Difference]: With dead ends: 282 [2024-11-10 09:13:52,307 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 09:13:52,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:13:52,308 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 113 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:13:52,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1093 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 09:13:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 09:13:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2024-11-10 09:13:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 161 states have internal predecessors, (209), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:13:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2024-11-10 09:13:52,322 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 98 [2024-11-10 09:13:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:13:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2024-11-10 09:13:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 09:13:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2024-11-10 09:13:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 09:13:52,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:13:52,324 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:13:52,340 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 (11)] Forceful destruction successful, exit code 0 [2024-11-10 09:13:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:52,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:13:52,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:13:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 572178373, now seen corresponding path program 1 times [2024-11-10 09:13:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:13:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877289956] [2024-11-10 09:13:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:13:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:13:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:13:52,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:13:52,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 09:13:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:13:53,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:13:53,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:13:53,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-10 09:13:53,785 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 16 treesize of output 8 [2024-11-10 09:13:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-10 09:13:54,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:14:10,338 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 105 treesize of output 57 [2024-11-10 09:14:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 09:14:10,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:14:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877289956] [2024-11-10 09:14:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877289956] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:14:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:14:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2024-11-10 09:14:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813627744] [2024-11-10 09:14:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:14:10,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:14:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:14:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:14:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:14:10,533 INFO L87 Difference]: Start difference. First operand 182 states and 245 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)