./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:22:35,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:22:35,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:22:35,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:22:35,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:22:35,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:22:35,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:22:35,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:22:35,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:22:35,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:22:35,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:22:35,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:22:35,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:22:35,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:22:35,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:22:35,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:22:35,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:22:35,747 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:22:35,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:22:35,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:22:35,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:22:35,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:22:35,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:22:35,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:22:35,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:22:35,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:22:35,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:22:35,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:22:35,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:22:35,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:22:35,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:22:35,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:22:35,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:22:35,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:22:35,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:22:35,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:22:35,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:22:35,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:22:35,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:22:35,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:22:35,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:22:35,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:22:35,756 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2024-11-20 08:22:36,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:22:36,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:22:36,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:22:36,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:22:36,103 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:22:36,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:22:37,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:22:37,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:22:37,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:22:37,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98aaf898/fc04e30748b54353a3ffd4c969ac2af3/FLAG2c15b4da6 [2024-11-20 08:22:37,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f98aaf898/fc04e30748b54353a3ffd4c969ac2af3 [2024-11-20 08:22:37,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:22:37,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:22:37,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:22:37,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:22:37,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:22:37,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:37" (1/1) ... [2024-11-20 08:22:37,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572524cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:37, skipping insertion in model container [2024-11-20 08:22:37,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:37" (1/1) ... [2024-11-20 08:22:37,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:22:38,118 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-21.i[916,929] [2024-11-20 08:22:38,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:22:38,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:22:38,239 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-21.i[916,929] [2024-11-20 08:22:38,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:22:38,310 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:22:38,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38 WrapperNode [2024-11-20 08:22:38,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:22:38,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:22:38,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:22:38,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:22:38,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,362 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-20 08:22:38,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:22:38,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:22:38,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:22:38,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:22:38,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,396 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2024-11-20 08:22:38,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:22:38,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:22:38,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:22:38,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:22:38,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (1/1) ... [2024-11-20 08:22:38,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:22:38,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:22:38,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:22:38,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:22:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:22:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:22:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:22:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:22:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:22:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:22:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:22:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:22:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:22:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:22:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:22:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:22:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:22:38,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:22:38,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:22:38,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:22:38,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:22:38,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:22:38,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:22:38,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:22:38,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:22:38,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:22:38,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:22:38,685 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:22:38,687 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:22:39,023 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-20 08:22:39,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:22:39,042 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:22:39,043 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:22:39,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:22:39 BoogieIcfgContainer [2024-11-20 08:22:39,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:22:39,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:22:39,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:22:39,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:22:39,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:22:37" (1/3) ... [2024-11-20 08:22:39,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6469d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:22:39, skipping insertion in model container [2024-11-20 08:22:39,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:38" (2/3) ... [2024-11-20 08:22:39,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6469d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:22:39, skipping insertion in model container [2024-11-20 08:22:39,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:22:39" (3/3) ... [2024-11-20 08:22:39,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:22:39,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:22:39,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:22:39,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:22:39,146 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;@67a9b9e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:22:39,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:22:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:22:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:22:39,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:39,158 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:39,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1393676978, now seen corresponding path program 1 times [2024-11-20 08:22:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:39,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926963058] [2024-11-20 08:22:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926963058] [2024-11-20 08:22:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926963058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:22:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121392183] [2024-11-20 08:22:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:22:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:22:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:22:39,587 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:39,617 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-20 08:22:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:22:39,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-20 08:22:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:39,638 INFO L225 Difference]: With dead ends: 185 [2024-11-20 08:22:39,638 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 08:22:39,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:22:39,651 INFO L432 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:39,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 08:22:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 08:22:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:22:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-20 08:22:39,698 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-20 08:22:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:39,698 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-20 08:22:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-20 08:22:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:22:39,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:39,701 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:39,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:22:39,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:39,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash -259048304, now seen corresponding path program 1 times [2024-11-20 08:22:39,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:39,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148636609] [2024-11-20 08:22:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:39,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148636609] [2024-11-20 08:22:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148636609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:22:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131561783] [2024-11-20 08:22:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:39,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:22:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:22:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:22:39,875 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:39,898 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2024-11-20 08:22:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:22:39,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-20 08:22:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:39,903 INFO L225 Difference]: With dead ends: 183 [2024-11-20 08:22:39,903 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 08:22:39,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:22:39,904 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:39,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 08:22:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-20 08:22:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:22:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-20 08:22:39,913 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2024-11-20 08:22:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-20 08:22:39,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-20 08:22:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:22:39,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:39,918 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:39,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:22:39,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:39,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 158348302, now seen corresponding path program 1 times [2024-11-20 08:22:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930985474] [2024-11-20 08:22:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930985474] [2024-11-20 08:22:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930985474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:40,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:22:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938178294] [2024-11-20 08:22:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:22:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:40,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:22:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:22:40,422 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:40,582 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2024-11-20 08:22:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:22:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-20 08:22:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:40,585 INFO L225 Difference]: With dead ends: 307 [2024-11-20 08:22:40,587 INFO L226 Difference]: Without dead ends: 216 [2024-11-20 08:22:40,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:22:40,589 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:40,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 704 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:22:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-20 08:22:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2024-11-20 08:22:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:22:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2024-11-20 08:22:40,611 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2024-11-20 08:22:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:40,612 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2024-11-20 08:22:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2024-11-20 08:22:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 08:22:40,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:40,615 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:22:40,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1038830393, now seen corresponding path program 1 times [2024-11-20 08:22:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484436276] [2024-11-20 08:22:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:40,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484436276] [2024-11-20 08:22:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484436276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:40,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:22:40,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513030131] [2024-11-20 08:22:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:22:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:40,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:22:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:22:40,774 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:40,802 INFO L93 Difference]: Finished difference Result 378 states and 549 transitions. [2024-11-20 08:22:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:22:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-11-20 08:22:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:40,804 INFO L225 Difference]: With dead ends: 378 [2024-11-20 08:22:40,805 INFO L226 Difference]: Without dead ends: 192 [2024-11-20 08:22:40,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-20 08:22:40,808 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:40,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-20 08:22:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-20 08:22:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:22:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2024-11-20 08:22:40,827 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 83 [2024-11-20 08:22:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:40,828 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2024-11-20 08:22:40,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2024-11-20 08:22:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-20 08:22:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:40,829 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:22:40,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -564200222, now seen corresponding path program 1 times [2024-11-20 08:22:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137776288] [2024-11-20 08:22:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137776288] [2024-11-20 08:22:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137776288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:22:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844172252] [2024-11-20 08:22:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:22:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:22:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:22:41,358 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:41,475 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2024-11-20 08:22:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:22:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-11-20 08:22:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:41,477 INFO L225 Difference]: With dead ends: 490 [2024-11-20 08:22:41,477 INFO L226 Difference]: Without dead ends: 301 [2024-11-20 08:22:41,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:22:41,479 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 131 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:41,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 913 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:22:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-20 08:22:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 227. [2024-11-20 08:22:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 210 states have internal predecessors, (295), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:22:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2024-11-20 08:22:41,489 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 87 [2024-11-20 08:22:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:41,490 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2024-11-20 08:22:41,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2024-11-20 08:22:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 08:22:41,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:41,491 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:41,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:22:41,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:41,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -205138822, now seen corresponding path program 1 times [2024-11-20 08:22:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:41,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928871723] [2024-11-20 08:22:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928871723] [2024-11-20 08:22:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928871723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:41,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:41,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:22:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375129913] [2024-11-20 08:22:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:22:41,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:41,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:22:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:22:41,916 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:42,016 INFO L93 Difference]: Finished difference Result 431 states and 608 transitions. [2024-11-20 08:22:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:22:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-11-20 08:22:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:42,018 INFO L225 Difference]: With dead ends: 431 [2024-11-20 08:22:42,018 INFO L226 Difference]: Without dead ends: 314 [2024-11-20 08:22:42,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:22:42,019 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 37 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:42,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 748 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:22:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-20 08:22:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 230. [2024-11-20 08:22:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 213 states have internal predecessors, (298), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:22:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 326 transitions. [2024-11-20 08:22:42,027 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 326 transitions. Word has length 88 [2024-11-20 08:22:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 326 transitions. [2024-11-20 08:22:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 326 transitions. [2024-11-20 08:22:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:22:42,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:42,029 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:22:42,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -145742675, now seen corresponding path program 1 times [2024-11-20 08:22:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572780969] [2024-11-20 08:22:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572780969] [2024-11-20 08:22:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572780969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:42,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:22:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584704642] [2024-11-20 08:22:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:22:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:22:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:22:42,201 INFO L87 Difference]: Start difference. First operand 230 states and 326 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:42,235 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2024-11-20 08:22:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:22:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-11-20 08:22:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:42,237 INFO L225 Difference]: With dead ends: 240 [2024-11-20 08:22:42,237 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 08:22:42,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:22:42,237 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:42,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 08:22:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-20 08:22:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 221 states have internal predecessors, (306), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:22:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2024-11-20 08:22:42,244 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 89 [2024-11-20 08:22:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2024-11-20 08:22:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2024-11-20 08:22:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 08:22:42,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:42,246 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:22:42,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -217896198, now seen corresponding path program 1 times [2024-11-20 08:22:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032264946] [2024-11-20 08:22:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032264946] [2024-11-20 08:22:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032264946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:42,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:22:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053634872] [2024-11-20 08:22:42,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:22:42,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:42,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:22:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:22:42,737 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:42,953 INFO L93 Difference]: Finished difference Result 800 states and 1117 transitions. [2024-11-20 08:22:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:22:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-20 08:22:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:42,956 INFO L225 Difference]: With dead ends: 800 [2024-11-20 08:22:42,956 INFO L226 Difference]: Without dead ends: 565 [2024-11-20 08:22:42,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:22:42,958 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 336 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:42,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1062 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:22:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-20 08:22:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 459. [2024-11-20 08:22:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 426 states have (on average 1.3943661971830985) internal successors, (594), 426 states have internal predecessors, (594), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 08:22:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 650 transitions. [2024-11-20 08:22:42,980 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 650 transitions. Word has length 89 [2024-11-20 08:22:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 650 transitions. [2024-11-20 08:22:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:22:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 650 transitions. [2024-11-20 08:22:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 08:22:42,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:42,982 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:42,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:22:42,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -353095500, now seen corresponding path program 1 times [2024-11-20 08:22:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802009609] [2024-11-20 08:22:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:43,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802009609] [2024-11-20 08:22:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802009609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:22:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879366414] [2024-11-20 08:22:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:22:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:22:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:22:43,125 INFO L87 Difference]: Start difference. First operand 459 states and 650 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:43,230 INFO L93 Difference]: Finished difference Result 1087 states and 1520 transitions. [2024-11-20 08:22:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:22:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-20 08:22:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:43,233 INFO L225 Difference]: With dead ends: 1087 [2024-11-20 08:22:43,233 INFO L226 Difference]: Without dead ends: 631 [2024-11-20 08:22:43,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:22:43,234 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 227 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:43,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 635 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:22:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-20 08:22:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 533. [2024-11-20 08:22:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 500 states have (on average 1.38) internal successors, (690), 500 states have internal predecessors, (690), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 08:22:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 746 transitions. [2024-11-20 08:22:43,250 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 746 transitions. Word has length 90 [2024-11-20 08:22:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:43,251 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 746 transitions. [2024-11-20 08:22:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 746 transitions. [2024-11-20 08:22:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 08:22:43,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:43,252 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:43,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:22:43,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -66064140, now seen corresponding path program 1 times [2024-11-20 08:22:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543352380] [2024-11-20 08:22:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543352380] [2024-11-20 08:22:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543352380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:22:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858146936] [2024-11-20 08:22:43,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:43,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:22:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:22:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:22:43,372 INFO L87 Difference]: Start difference. First operand 533 states and 746 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:43,422 INFO L93 Difference]: Finished difference Result 1079 states and 1509 transitions. [2024-11-20 08:22:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:22:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-20 08:22:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:43,425 INFO L225 Difference]: With dead ends: 1079 [2024-11-20 08:22:43,425 INFO L226 Difference]: Without dead ends: 549 [2024-11-20 08:22:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:22:43,426 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-20 08:22:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 537. [2024-11-20 08:22:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 504 states have (on average 1.376984126984127) internal successors, (694), 504 states have internal predecessors, (694), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 08:22:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 750 transitions. [2024-11-20 08:22:43,463 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 750 transitions. Word has length 90 [2024-11-20 08:22:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:43,463 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 750 transitions. [2024-11-20 08:22:43,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 750 transitions. [2024-11-20 08:22:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 08:22:43,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:43,464 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:43,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:22:43,464 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:43,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1463893872, now seen corresponding path program 1 times [2024-11-20 08:22:43,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:43,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496924174] [2024-11-20 08:22:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:22:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:22:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:22:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:22:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:22:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:22:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:22:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:22:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:22:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:22:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496924174] [2024-11-20 08:22:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496924174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:22:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:22:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:22:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961939013] [2024-11-20 08:22:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:22:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:22:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:22:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:22:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:22:43,520 INFO L87 Difference]: Start difference. First operand 537 states and 750 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:22:43,540 INFO L93 Difference]: Finished difference Result 1079 states and 1513 transitions. [2024-11-20 08:22:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:22:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-20 08:22:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:22:43,544 INFO L225 Difference]: With dead ends: 1079 [2024-11-20 08:22:43,544 INFO L226 Difference]: Without dead ends: 545 [2024-11-20 08:22:43,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-20 08:22:43,545 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:22:43,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:22:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-20 08:22:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-11-20 08:22:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 511 states have (on average 1.3718199608610568) internal successors, (701), 511 states have internal predecessors, (701), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 08:22:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 757 transitions. [2024-11-20 08:22:43,564 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 757 transitions. Word has length 90 [2024-11-20 08:22:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:22:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 757 transitions. [2024-11-20 08:22:43,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:22:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 757 transitions. [2024-11-20 08:22:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 08:22:43,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:22:43,566 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:43,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:22:43,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:22:43,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:22:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1242725522, now seen corresponding path program 1 times [2024-11-20 08:22:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:22:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258764243] [2024-11-20 08:22:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:22:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:22:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583601625] [2024-11-20 08:22:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:22:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:22:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:22:43,597 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-20 08:22:43,599 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-20 08:22:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:22:43,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:22:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:22:43,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:22:43,889 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:22:43,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:22:43,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:22:44,091 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,SelfDestructingSolverStorable11 [2024-11-20 08:22:44,094 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:22:44,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:22:44,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:22:44 BoogieIcfgContainer [2024-11-20 08:22:44,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:22:44,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:22:44,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:22:44,155 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:22:44,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:22:39" (3/4) ... [2024-11-20 08:22:44,157 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:22:44,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:22:44,158 INFO L158 Benchmark]: Toolchain (without parser) took 6219.47ms. Allocated memory was 167.8MB in the beginning and 341.8MB in the end (delta: 174.1MB). Free memory was 94.0MB in the beginning and 220.2MB in the end (delta: -126.2MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,158 INFO L158 Benchmark]: CDTParser took 3.81ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:22:44,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.05ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 93.8MB in the beginning and 204.1MB in the end (delta: -110.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.45ms. Allocated memory is still 234.9MB. Free memory was 204.1MB in the beginning and 201.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,159 INFO L158 Benchmark]: Boogie Preprocessor took 58.71ms. Allocated memory is still 234.9MB. Free memory was 201.0MB in the beginning and 196.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,159 INFO L158 Benchmark]: RCFGBuilder took 621.09ms. Allocated memory is still 234.9MB. Free memory was 196.8MB in the beginning and 164.3MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,159 INFO L158 Benchmark]: TraceAbstraction took 5105.75ms. Allocated memory was 234.9MB in the beginning and 341.8MB in the end (delta: 107.0MB). Free memory was 163.2MB in the beginning and 220.2MB in the end (delta: -56.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-11-20 08:22:44,160 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 341.8MB. Free memory is still 220.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:22:44,160 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.81ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.05ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 93.8MB in the beginning and 204.1MB in the end (delta: -110.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.45ms. Allocated memory is still 234.9MB. Free memory was 204.1MB in the beginning and 201.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.71ms. Allocated memory is still 234.9MB. Free memory was 201.0MB in the beginning and 196.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 621.09ms. Allocated memory is still 234.9MB. Free memory was 196.8MB in the beginning and 164.3MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5105.75ms. Allocated memory was 234.9MB in the beginning and 341.8MB in the end (delta: 107.0MB). Free memory was 163.2MB in the beginning and 220.2MB in the end (delta: -56.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 341.8MB. Free memory is still 220.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_1_ = 0; [L38] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L82] EXPR BOOL_unsigned_char_Array_0[1] [L82] last_1_BOOL_unsigned_char_Array_0_1_ = BOOL_unsigned_char_Array_0[1] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] double_Array_0[0] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] double_Array_0[1] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] double_Array_0[2] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] RET updateVariables() [L95] CALL step() [L42] COND TRUE (last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE BOOL_unsigned_char_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR float_Array_0[1] [L52] EXPR double_Array_0[1] [L52] EXPR double_Array_0[2] [L52] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] COND FALSE !((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_short_int_Array_0[0] = unsigned_short_int_Array_0[0] [L58] EXPR double_Array_0[1] [L58] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L58] EXPR double_Array_0[1] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] COND TRUE ((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] COND FALSE !(last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) [L86] EXPR double_Array_0[1] [L86] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L86] EXPR double_Array_0[1] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) [L86] EXPR BOOL_unsigned_char_Array_0[1] [L86] EXPR BOOL_unsigned_char_Array_0[0] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86-L87] return ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 970 mSDsluCounter, 7133 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5595 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 722 IncrementalHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1538 mSDtfsCounter, 722 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 402 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 2881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 924/924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:22:44,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:22:46,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:22:46,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:22:46,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:22:46,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:22:46,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:22:46,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:22:46,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:22:46,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:22:46,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:22:46,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:22:46,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:22:46,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:22:46,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:22:46,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:22:46,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:22:46,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:22:46,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:22:46,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:22:46,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:22:46,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:22:46,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:22:46,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:22:46,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:22:46,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:22:46,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:22:46,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:22:46,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:22:46,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:22:46,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:22:46,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:22:46,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:22:46,341 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:22:46,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:22:46,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:22:46,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:22:46,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:22:46,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:22:46,344 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2024-11-20 08:22:46,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:22:46,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:22:46,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:22:46,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:22:46,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:22:46,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:22:48,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:22:48,388 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:22:48,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:22:48,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32220eab1/c68e9f1f75e44069a757dce817844b3c/FLAGecd8a6096 [2024-11-20 08:22:48,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32220eab1/c68e9f1f75e44069a757dce817844b3c [2024-11-20 08:22:48,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:22:48,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:22:48,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:22:48,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:22:48,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:22:48,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589229ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48, skipping insertion in model container [2024-11-20 08:22:48,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:22:48,597 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-21.i[916,929] [2024-11-20 08:22:48,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:22:48,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:22:48,693 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-21.i[916,929] [2024-11-20 08:22:48,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:22:48,772 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:22:48,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48 WrapperNode [2024-11-20 08:22:48,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:22:48,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:22:48,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:22:48,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:22:48,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,852 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-20 08:22:48,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:22:48,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:22:48,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:22:48,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:22:48,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,905 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2024-11-20 08:22:48,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:22:48,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:22:48,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:22:48,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:22:48,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (1/1) ... [2024-11-20 08:22:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:22:48,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:22:49,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:22:49,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-20 08:22:49,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-20 08:22:49,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-20 08:22:49,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 08:22:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 08:22:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-20 08:22:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-20 08:22:49,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 08:22:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:22:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:22:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:22:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:22:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:22:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 08:22:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-20 08:22:49,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-20 08:22:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-20 08:22:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-20 08:22:49,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-20 08:22:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-20 08:22:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:22:49,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:22:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:22:49,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:22:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:22:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:22:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:22:49,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-20 08:22:49,242 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:22:49,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:23:01,358 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-20 08:23:01,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:23:01,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:23:01,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:23:01,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:01 BoogieIcfgContainer [2024-11-20 08:23:01,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:23:01,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:23:01,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:23:01,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:23:01,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:22:48" (1/3) ... [2024-11-20 08:23:01,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146e5ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:01, skipping insertion in model container [2024-11-20 08:23:01,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:22:48" (2/3) ... [2024-11-20 08:23:01,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146e5ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:01, skipping insertion in model container [2024-11-20 08:23:01,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:01" (3/3) ... [2024-11-20 08:23:01,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2024-11-20 08:23:01,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:23:01,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:23:01,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:23:01,436 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;@3be263e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:23:01,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:23:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:23:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:23:01,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:01,450 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:01,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:01,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1393676978, now seen corresponding path program 1 times [2024-11-20 08:23:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355874749] [2024-11-20 08:23:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:01,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:01,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:01,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:23:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:01,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:23:01,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 08:23:01,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:01,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:01,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355874749] [2024-11-20 08:23:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355874749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:23:01,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70160733] [2024-11-20 08:23:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:23:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:01,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:23:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:23:01,831 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:01,863 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-20 08:23:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:23:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-20 08:23:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:01,880 INFO L225 Difference]: With dead ends: 185 [2024-11-20 08:23:01,880 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 08:23:01,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:23:01,888 INFO L432 NwaCegarLoop]: 135 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, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:01,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 08:23:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 08:23:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:23:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-20 08:23:01,943 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-20 08:23:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:01,943 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-20 08:23:01,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-20 08:23:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:23:01,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:01,946 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:01,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:23:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:02,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:02,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash -259048304, now seen corresponding path program 1 times [2024-11-20 08:23:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377908012] [2024-11-20 08:23:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:02,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:02,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:02,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:02,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:23:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:02,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:23:02,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-20 08:23:02,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:02,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377908012] [2024-11-20 08:23:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377908012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:23:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153703556] [2024-11-20 08:23:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:02,462 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:02,530 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2024-11-20 08:23:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-20 08:23:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:02,531 INFO L225 Difference]: With dead ends: 183 [2024-11-20 08:23:02,531 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 08:23:02,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:02,533 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:02,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 08:23:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-20 08:23:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 08:23:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-20 08:23:02,540 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2024-11-20 08:23:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:02,540 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-20 08:23:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-20 08:23:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 08:23:02,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:02,542 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:02,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:23:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:02,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 158348302, now seen corresponding path program 1 times [2024-11-20 08:23:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:02,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305608713] [2024-11-20 08:23:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:02,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:02,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:23:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:02,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:23:02,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:02,988 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 17 treesize of output 9 [2024-11-20 08:23:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:23:03,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:03,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305608713] [2024-11-20 08:23:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305608713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:23:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736526118] [2024-11-20 08:23:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:03,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:03,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:03,124 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:06,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:08,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:12,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:14,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:18,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:22,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:22,673 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2024-11-20 08:23:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-20 08:23:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:22,696 INFO L225 Difference]: With dead ends: 307 [2024-11-20 08:23:22,696 INFO L226 Difference]: Without dead ends: 216 [2024-11-20 08:23:22,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:23:22,701 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 236 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:22,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 370 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 19.5s Time] [2024-11-20 08:23:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-20 08:23:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2024-11-20 08:23:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2024-11-20 08:23:22,735 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2024-11-20 08:23:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:22,736 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2024-11-20 08:23:22,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2024-11-20 08:23:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 08:23:22,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:22,737 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:22,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 08:23:22,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:22,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1038830393, now seen corresponding path program 1 times [2024-11-20 08:23:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:22,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191911920] [2024-11-20 08:23:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:22,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:22,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:22,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:22,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 08:23:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:23,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 08:23:23,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:23,669 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 27 treesize of output 15 [2024-11-20 08:23:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 08:23:23,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 08:23:24,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191911920] [2024-11-20 08:23:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191911920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:23:24,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:23:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-20 08:23:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892092918] [2024-11-20 08:23:24,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:23:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:23:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:23:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:23:24,105 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-20 08:23:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:24,503 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2024-11-20 08:23:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:23:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 83 [2024-11-20 08:23:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:24,504 INFO L225 Difference]: With dead ends: 360 [2024-11-20 08:23:24,504 INFO L226 Difference]: Without dead ends: 174 [2024-11-20 08:23:24,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:23:24,509 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:24,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 788 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:23:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-20 08:23:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-20 08:23:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2024-11-20 08:23:24,522 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 83 [2024-11-20 08:23:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:24,522 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2024-11-20 08:23:24,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-20 08:23:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2024-11-20 08:23:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 08:23:24,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:24,523 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:24,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 08:23:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:24,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1596084527, now seen corresponding path program 1 times [2024-11-20 08:23:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302163872] [2024-11-20 08:23:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:24,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:24,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:24,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:24,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 08:23:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:25,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:23:25,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:23:25,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:25,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:25,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302163872] [2024-11-20 08:23:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302163872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:23:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897301062] [2024-11-20 08:23:25,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:25,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:23:25,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:25,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:23:25,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:23:25,057 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:25,180 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2024-11-20 08:23:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:23:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-11-20 08:23:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:25,181 INFO L225 Difference]: With dead ends: 276 [2024-11-20 08:23:25,182 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 08:23:25,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-20 08:23:25,183 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:25,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:23:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 08:23:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-20 08:23:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 156 states have internal predecessors, (214), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-11-20 08:23:25,192 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 84 [2024-11-20 08:23:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-11-20 08:23:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-11-20 08:23:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 08:23:25,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:25,193 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:25,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 08:23:25,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:25,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -205138822, now seen corresponding path program 1 times [2024-11-20 08:23:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525095556] [2024-11-20 08:23:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:25,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:25,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 08:23:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:25,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:23:25,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:25,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-20 08:23:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-20 08:23:25,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:25,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525095556] [2024-11-20 08:23:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525095556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:23:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596252672] [2024-11-20 08:23:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:23:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:23:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:23:25,905 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:28,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:31,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:34,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:37,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:37,443 INFO L93 Difference]: Finished difference Result 311 states and 426 transitions. [2024-11-20 08:23:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:23:37,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-11-20 08:23:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:37,487 INFO L225 Difference]: With dead ends: 311 [2024-11-20 08:23:37,487 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 08:23:37,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:23:37,488 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:37,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-20 08:23:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 08:23:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-20 08:23:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.358974358974359) internal successors, (212), 156 states have internal predecessors, (212), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2024-11-20 08:23:37,506 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 88 [2024-11-20 08:23:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:37,506 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2024-11-20 08:23:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2024-11-20 08:23:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-20 08:23:37,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:37,507 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:37,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 08:23:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:37,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:37,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1014561932, now seen corresponding path program 1 times [2024-11-20 08:23:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293488134] [2024-11-20 08:23:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:37,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 08:23:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:38,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:23:38,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:38,325 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-20 08:23:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:38,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:38,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293488134] [2024-11-20 08:23:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293488134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:38,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:23:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011778896] [2024-11-20 08:23:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:23:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:23:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:23:38,369 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:41,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:45,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:47,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:51,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:51,596 INFO L93 Difference]: Finished difference Result 304 states and 412 transitions. [2024-11-20 08:23:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:23:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2024-11-20 08:23:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:51,620 INFO L225 Difference]: With dead ends: 304 [2024-11-20 08:23:51,621 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 08:23:51,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:23:51,621 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:51,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 402 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-20 08:23:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 08:23:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-20 08:23:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 states have internal predecessors, (210), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 238 transitions. [2024-11-20 08:23:51,640 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 238 transitions. Word has length 90 [2024-11-20 08:23:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:51,640 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 238 transitions. [2024-11-20 08:23:51,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 08:23:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 238 transitions. [2024-11-20 08:23:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 08:23:51,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:51,641 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:51,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:23:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:51,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:51,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1284278854, now seen corresponding path program 1 times [2024-11-20 08:23:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976702801] [2024-11-20 08:23:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:51,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:51,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 08:23:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:52,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:23:52,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:52,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-20 08:23:53,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2024-11-20 08:23:54,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:23:54,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 44 [2024-11-20 08:23:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 08:23:54,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:23:54,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976702801] [2024-11-20 08:23:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976702801] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:23:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:23:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-20 08:23:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207250659] [2024-11-20 08:23:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:23:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:23:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:23:54,470 INFO L87 Difference]: Start difference. First operand 177 states and 238 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:54,773 INFO L93 Difference]: Finished difference Result 319 states and 431 transitions. [2024-11-20 08:23:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:23:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 92 [2024-11-20 08:23:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:54,775 INFO L225 Difference]: With dead ends: 319 [2024-11-20 08:23:54,775 INFO L226 Difference]: Without dead ends: 217 [2024-11-20 08:23:54,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:23:54,776 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:54,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 618 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:23:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-20 08:23:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2024-11-20 08:23:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 176 states have internal predecessors, (236), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2024-11-20 08:23:54,784 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 92 [2024-11-20 08:23:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:54,784 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2024-11-20 08:23:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:23:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2024-11-20 08:23:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 08:23:54,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:54,785 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:54,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 08:23:54,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:54,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -651573371, now seen corresponding path program 1 times [2024-11-20 08:23:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968842989] [2024-11-20 08:23:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:54,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:54,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:23:54,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 08:23:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:55,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:23:55,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:56,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-20 08:23:56,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:23:56,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2024-11-20 08:23:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 08:23:56,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 08:23:58,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968842989] [2024-11-20 08:23:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968842989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:23:58,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:23:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-20 08:23:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869975157] [2024-11-20 08:23:58,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:23:58,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 08:23:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:58,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 08:23:58,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-11-20 08:23:58,201 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-20 08:23:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:59,279 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2024-11-20 08:23:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 08:23:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2024-11-20 08:23:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:59,282 INFO L225 Difference]: With dead ends: 341 [2024-11-20 08:23:59,282 INFO L226 Difference]: Without dead ends: 222 [2024-11-20 08:23:59,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 08:23:59,284 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 690 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:59,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1171 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:23:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-20 08:23:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 197. [2024-11-20 08:23:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 08:23:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2024-11-20 08:23:59,290 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 94 [2024-11-20 08:23:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:59,290 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2024-11-20 08:23:59,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-20 08:23:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2024-11-20 08:23:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 08:23:59,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:59,291 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:23:59,306 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 (10)] Ended with exit code 0 [2024-11-20 08:23:59,495 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-20 08:23:59,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 864621008, now seen corresponding path program 1 times [2024-11-20 08:23:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:59,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369789092] [2024-11-20 08:23:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:59,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:23:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:59,500 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-20 08:23:59,501 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-20 08:23:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:59,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:23:59,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:59,912 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-20 08:24:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:24:00,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:24:00,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369789092] [2024-11-20 08:24:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369789092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:24:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:24:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:24:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954213287] [2024-11-20 08:24:00,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:24:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:24:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:24:00,160 INFO L87 Difference]: Start difference. First operand 197 states and 263 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:24:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:00,421 INFO L93 Difference]: Finished difference Result 492 states and 662 transitions. [2024-11-20 08:24:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:24:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2024-11-20 08:24:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:00,423 INFO L225 Difference]: With dead ends: 492 [2024-11-20 08:24:00,424 INFO L226 Difference]: Without dead ends: 369 [2024-11-20 08:24:00,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:24:00,424 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 232 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:00,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 574 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:24:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-20 08:24:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 298. [2024-11-20 08:24:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 267 states have (on average 1.3333333333333333) internal successors, (356), 267 states have internal predecessors, (356), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:24:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2024-11-20 08:24:00,436 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 94 [2024-11-20 08:24:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2024-11-20 08:24:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:24:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2024-11-20 08:24:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 08:24:00,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:00,437 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:24:00,452 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 (11)] Ended with exit code 0 [2024-11-20 08:24:00,638 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-20 08:24:00,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:00,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash -723726894, now seen corresponding path program 1 times [2024-11-20 08:24:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830845539] [2024-11-20 08:24:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:24:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:00,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:24:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 08:24:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:01,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:24:01,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:03,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:24:03,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 113 [2024-11-20 08:24:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 08:24:03,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:24:05,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830845539] [2024-11-20 08:24:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830845539] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:24:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:24:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2024-11-20 08:24:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446510287] [2024-11-20 08:24:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:24:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:24:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:24:05,206 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:24:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:07,386 INFO L93 Difference]: Finished difference Result 658 states and 872 transitions. [2024-11-20 08:24:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:24:07,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 94 [2024-11-20 08:24:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:07,392 INFO L225 Difference]: With dead ends: 658 [2024-11-20 08:24:07,393 INFO L226 Difference]: Without dead ends: 438 [2024-11-20 08:24:07,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:24:07,394 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:07,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 614 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 08:24:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-20 08:24:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2024-11-20 08:24:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 390 states have (on average 1.317948717948718) internal successors, (514), 392 states have internal predecessors, (514), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 08:24:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2024-11-20 08:24:07,423 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 94 [2024-11-20 08:24:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:07,423 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2024-11-20 08:24:07,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 08:24:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2024-11-20 08:24:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 08:24:07,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:07,424 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:24:07,439 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 (12)] Forceful destruction successful, exit code 0 [2024-11-20 08:24:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:24:07,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1116753904, now seen corresponding path program 1 times [2024-11-20 08:24:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297026677] [2024-11-20 08:24:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:07,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:24:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:07,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:24:07,633 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 (13)] Waiting until timeout for monitored process [2024-11-20 08:24:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:08,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 08:24:08,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 08:24:10,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 08:24:13,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297026677] [2024-11-20 08:24:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297026677] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:24:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:24:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-11-20 08:24:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250054810] [2024-11-20 08:24:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:13,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:24:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:24:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:24:13,243 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)