/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:29:49,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:29:49,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:29:49,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:29:49,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:29:49,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:29:49,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:29:49,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:29:49,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:29:49,641 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:29:49,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:29:49,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:29:49,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:29:49,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:29:49,643 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:29:49,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:29:49,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:29:49,644 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:29:49,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:29:49,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:29:49,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:29:49,645 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:29:49,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:29:49,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:49,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:29:49,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:29:49,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:29:49,648 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: Use bitabs translation -> true [2023-12-15 21:29:49,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:29:49,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:29:49,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:29:49,899 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:29:49,899 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:29:49,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2023-12-15 21:29:51,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:29:51,158 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:29:51,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i [2023-12-15 21:29:51,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3efcb651/f133bf10060a4e49abf4669aa3a9a07e/FLAG5e3ca67b1 [2023-12-15 21:29:51,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3efcb651/f133bf10060a4e49abf4669aa3a9a07e [2023-12-15 21:29:51,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:29:51,192 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:29:51,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:51,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:29:51,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:29:51,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509a1400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51, skipping insertion in model container [2023-12-15 21:29:51,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:29:51,308 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2023-12-15 21:29:51,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:51,366 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:29:51,374 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-28.i[916,929] [2023-12-15 21:29:51,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:51,416 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:29:51,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51 WrapperNode [2023-12-15 21:29:51,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:51,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:51,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:29:51,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:29:51,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,473 INFO L138 Inliner]: procedures = 29, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 585 [2023-12-15 21:29:51,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:51,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:29:51,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:29:51,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:29:51,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,504 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 52, 59, 19, 3, 17]. 39 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 4, 3, 1, 1]. The 17 writes are split as follows [0, 6, 5, 4, 1, 1]. [2023-12-15 21:29:51,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:29:51,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:29:51,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:29:51,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:29:51,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (1/1) ... [2023-12-15 21:29:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:51,638 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) [2023-12-15 21:29:51,642 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 [2023-12-15 21:29:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:29:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:29:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:29:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:29:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:29:51,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:29:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:29:51,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:29:51,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:29:51,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:29:51,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:29:51,779 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:29:51,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:29:52,231 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:29:52,266 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:29:52,266 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:29:52,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:52 BoogieIcfgContainer [2023-12-15 21:29:52,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:29:52,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:29:52,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:29:52,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:29:52,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:29:51" (1/3) ... [2023-12-15 21:29:52,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796bcced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:52, skipping insertion in model container [2023-12-15 21:29:52,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:51" (2/3) ... [2023-12-15 21:29:52,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796bcced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:52, skipping insertion in model container [2023-12-15 21:29:52,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:52" (3/3) ... [2023-12-15 21:29:52,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-28.i [2023-12-15 21:29:52,284 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:29:52,284 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:29:52,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:29:52,321 INFO L357 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, mHoare=true, 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;@38b7ae73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:29:52,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:29:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 98 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:29:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:29:52,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:52,344 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:52,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:52,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1464029505, now seen corresponding path program 1 times [2023-12-15 21:29:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103180718] [2023-12-15 21:29:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103180718] [2023-12-15 21:29:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103180718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:29:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578718004] [2023-12-15 21:29:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:29:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:29:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:52,736 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 98 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:29:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:52,763 INFO L93 Difference]: Finished difference Result 225 states and 354 transitions. [2023-12-15 21:29:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:29:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2023-12-15 21:29:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:52,770 INFO L225 Difference]: With dead ends: 225 [2023-12-15 21:29:52,771 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 21:29:52,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:52,775 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:52,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 21:29:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-15 21:29:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:29:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2023-12-15 21:29:52,804 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 125 [2023-12-15 21:29:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:52,804 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2023-12-15 21:29:52,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:29:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2023-12-15 21:29:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:29:52,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:52,808 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:52,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:29:52,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:52,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1602069293, now seen corresponding path program 1 times [2023-12-15 21:29:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989966103] [2023-12-15 21:29:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989966103] [2023-12-15 21:29:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989966103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66120184] [2023-12-15 21:29:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:53,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:53,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:53,070 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:53,136 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2023-12-15 21:29:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2023-12-15 21:29:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:53,141 INFO L225 Difference]: With dead ends: 227 [2023-12-15 21:29:53,141 INFO L226 Difference]: Without dead ends: 116 [2023-12-15 21:29:53,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:53,145 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:53,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 469 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-15 21:29:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2023-12-15 21:29:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:29:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-12-15 21:29:53,167 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 125 [2023-12-15 21:29:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:53,168 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-12-15 21:29:53,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-12-15 21:29:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:29:53,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:53,170 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:53,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:29:53,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:53,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1602009711, now seen corresponding path program 1 times [2023-12-15 21:29:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225969916] [2023-12-15 21:29:53,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:53,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:53,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225969916] [2023-12-15 21:29:53,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225969916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:53,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041364282] [2023-12-15 21:29:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:53,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:53,743 INFO L87 Difference]: Start difference. First operand 114 states and 166 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:53,897 INFO L93 Difference]: Finished difference Result 350 states and 509 transitions. [2023-12-15 21:29:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:53,898 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2023-12-15 21:29:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:53,900 INFO L225 Difference]: With dead ends: 350 [2023-12-15 21:29:53,900 INFO L226 Difference]: Without dead ends: 237 [2023-12-15 21:29:53,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:53,903 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 219 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:53,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 668 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-15 21:29:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 205. [2023-12-15 21:29:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.4166666666666667) internal successors, (255), 181 states have internal predecessors, (255), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 21:29:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 299 transitions. [2023-12-15 21:29:53,929 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 299 transitions. Word has length 125 [2023-12-15 21:29:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:53,931 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 299 transitions. [2023-12-15 21:29:53,931 INFO L496 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 299 transitions. [2023-12-15 21:29:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:29:53,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:53,935 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:29:53,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:53,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1705870081, now seen corresponding path program 1 times [2023-12-15 21:29:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915762696] [2023-12-15 21:29:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915762696] [2023-12-15 21:29:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915762696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151590721] [2023-12-15 21:29:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:54,100 INFO L87 Difference]: Start difference. First operand 205 states and 299 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:54,143 INFO L93 Difference]: Finished difference Result 461 states and 671 transitions. [2023-12-15 21:29:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2023-12-15 21:29:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:54,147 INFO L225 Difference]: With dead ends: 461 [2023-12-15 21:29:54,147 INFO L226 Difference]: Without dead ends: 257 [2023-12-15 21:29:54,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:54,155 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:54,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 666 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-15 21:29:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2023-12-15 21:29:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.403225806451613) internal successors, (261), 187 states have internal predecessors, (261), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 21:29:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 305 transitions. [2023-12-15 21:29:54,166 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 305 transitions. Word has length 127 [2023-12-15 21:29:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:54,167 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 305 transitions. [2023-12-15 21:29:54,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 305 transitions. [2023-12-15 21:29:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:29:54,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:54,171 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:54,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:29:54,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:54,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -973356042, now seen corresponding path program 1 times [2023-12-15 21:29:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498044593] [2023-12-15 21:29:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498044593] [2023-12-15 21:29:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498044593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:29:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098111387] [2023-12-15 21:29:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:29:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:29:54,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:29:54,736 INFO L87 Difference]: Start difference. First operand 211 states and 305 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:55,102 INFO L93 Difference]: Finished difference Result 872 states and 1255 transitions. [2023-12-15 21:29:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:29:55,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2023-12-15 21:29:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:55,105 INFO L225 Difference]: With dead ends: 872 [2023-12-15 21:29:55,105 INFO L226 Difference]: Without dead ends: 662 [2023-12-15 21:29:55,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:29:55,106 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 409 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:55,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1135 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-12-15 21:29:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 587. [2023-12-15 21:29:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 533 states have (on average 1.4202626641651033) internal successors, (757), 539 states have internal predecessors, (757), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-15 21:29:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 849 transitions. [2023-12-15 21:29:55,122 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 849 transitions. Word has length 127 [2023-12-15 21:29:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:55,122 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 849 transitions. [2023-12-15 21:29:55,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 849 transitions. [2023-12-15 21:29:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:29:55,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:55,123 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:55,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:29:55,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:55,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2041747576, now seen corresponding path program 1 times [2023-12-15 21:29:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362268914] [2023-12-15 21:29:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362268914] [2023-12-15 21:29:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362268914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846197831] [2023-12-15 21:29:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:55,543 INFO L87 Difference]: Start difference. First operand 587 states and 849 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:55,679 INFO L93 Difference]: Finished difference Result 1155 states and 1664 transitions. [2023-12-15 21:29:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2023-12-15 21:29:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:55,683 INFO L225 Difference]: With dead ends: 1155 [2023-12-15 21:29:55,683 INFO L226 Difference]: Without dead ends: 601 [2023-12-15 21:29:55,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:55,685 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 243 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:55,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 355 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2023-12-15 21:29:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2023-12-15 21:29:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 538 states have (on average 1.412639405204461) internal successors, (760), 544 states have internal predecessors, (760), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-15 21:29:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 856 transitions. [2023-12-15 21:29:55,706 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 856 transitions. Word has length 127 [2023-12-15 21:29:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:55,706 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 856 transitions. [2023-12-15 21:29:55,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 856 transitions. [2023-12-15 21:29:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:29:55,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:55,707 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:55,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:29:55,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:55,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1606391606, now seen corresponding path program 1 times [2023-12-15 21:29:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249193085] [2023-12-15 21:29:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:56,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249193085] [2023-12-15 21:29:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249193085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:29:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659286997] [2023-12-15 21:29:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:29:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:29:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:56,226 INFO L87 Difference]: Start difference. First operand 595 states and 856 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:29:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:56,580 INFO L93 Difference]: Finished difference Result 1189 states and 1706 transitions. [2023-12-15 21:29:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:29:56,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2023-12-15 21:29:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:56,583 INFO L225 Difference]: With dead ends: 1189 [2023-12-15 21:29:56,583 INFO L226 Difference]: Without dead ends: 635 [2023-12-15 21:29:56,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:56,585 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 463 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:56,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 692 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-12-15 21:29:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 623. [2023-12-15 21:29:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 554 states have (on average 1.3935018050541517) internal successors, (772), 560 states have internal predecessors, (772), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-15 21:29:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 888 transitions. [2023-12-15 21:29:56,606 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 888 transitions. Word has length 128 [2023-12-15 21:29:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:56,606 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 888 transitions. [2023-12-15 21:29:56,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:29:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 888 transitions. [2023-12-15 21:29:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:29:56,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:56,607 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:56,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:29:56,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:56,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -82552136, now seen corresponding path program 1 times [2023-12-15 21:29:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915166411] [2023-12-15 21:29:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-15 21:29:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915166411] [2023-12-15 21:29:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915166411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:29:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767851597] [2023-12-15 21:29:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:56,923 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) [2023-12-15 21:29:56,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:29:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:57,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 21:29:57,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:29:57,410 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 15 treesize of output 7 [2023-12-15 21:29:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-15 21:29:57,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:29:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-15 21:29:57,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767851597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:29:57,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:29:57,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-12-15 21:29:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657538875] [2023-12-15 21:29:57,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:29:57,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:29:57,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:29:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:29:57,583 INFO L87 Difference]: Start difference. First operand 623 states and 888 transitions. Second operand has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-15 21:29:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:57,818 INFO L93 Difference]: Finished difference Result 841 states and 1198 transitions. [2023-12-15 21:29:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:29:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) Word has length 128 [2023-12-15 21:29:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:57,819 INFO L225 Difference]: With dead ends: 841 [2023-12-15 21:29:57,819 INFO L226 Difference]: Without dead ends: 259 [2023-12-15 21:29:57,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:29:57,821 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 254 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:57,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 565 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-15 21:29:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2023-12-15 21:29:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 224 states have (on average 1.3839285714285714) internal successors, (310), 226 states have internal predecessors, (310), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 21:29:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 366 transitions. [2023-12-15 21:29:57,830 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 366 transitions. Word has length 128 [2023-12-15 21:29:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:57,830 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 366 transitions. [2023-12-15 21:29:57,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 8 states have call successors, (36) [2023-12-15 21:29:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 366 transitions. [2023-12-15 21:29:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:29:57,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:57,831 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:57,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:29:58,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:58,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash -345167023, now seen corresponding path program 1 times [2023-12-15 21:29:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217450309] [2023-12-15 21:29:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 21:29:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:29:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:29:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:29:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:29:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:29:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:29:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217450309] [2023-12-15 21:29:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217450309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:58,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719931825] [2023-12-15 21:29:58,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:58,154 INFO L87 Difference]: Start difference. First operand 259 states and 366 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:58,180 INFO L93 Difference]: Finished difference Result 477 states and 675 transitions. [2023-12-15 21:29:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:58,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2023-12-15 21:29:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:58,182 INFO L225 Difference]: With dead ends: 477 [2023-12-15 21:29:58,182 INFO L226 Difference]: Without dead ends: 259 [2023-12-15 21:29:58,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:58,183 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:58,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-15 21:29:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2023-12-15 21:29:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 224 states have (on average 1.375) internal successors, (308), 226 states have internal predecessors, (308), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 21:29:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 364 transitions. [2023-12-15 21:29:58,191 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 364 transitions. Word has length 129 [2023-12-15 21:29:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:58,191 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 364 transitions. [2023-12-15 21:29:58,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:29:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2023-12-15 21:29:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 21:29:58,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:58,192 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:29:58,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2034110765, now seen corresponding path program 1 times [2023-12-15 21:29:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170194140] [2023-12-15 21:29:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:58,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:29:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:58,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:29:58,314 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:29:58,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:29:58,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:29:58,318 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:58,320 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:29:58,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:29:58 BoogieIcfgContainer [2023-12-15 21:29:58,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:29:58,369 INFO L158 Benchmark]: Toolchain (without parser) took 7177.47ms. Allocated memory was 198.2MB in the beginning and 348.1MB in the end (delta: 149.9MB). Free memory was 148.1MB in the beginning and 135.5MB in the end (delta: 12.6MB). Peak memory consumption was 163.5MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,369 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:29:58,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.53ms. Allocated memory is still 198.2MB. Free memory was 148.1MB in the beginning and 131.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.60ms. Allocated memory is still 198.2MB. Free memory was 131.9MB in the beginning and 127.4MB in the end (delta: 4.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,370 INFO L158 Benchmark]: Boogie Preprocessor took 92.77ms. Allocated memory is still 198.2MB. Free memory was 127.4MB in the beginning and 122.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,370 INFO L158 Benchmark]: RCFGBuilder took 698.60ms. Allocated memory is still 198.2MB. Free memory was 122.2MB in the beginning and 140.0MB in the end (delta: -17.8MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,370 INFO L158 Benchmark]: TraceAbstraction took 6101.04ms. Allocated memory was 198.2MB in the beginning and 348.1MB in the end (delta: 149.9MB). Free memory was 138.9MB in the beginning and 135.5MB in the end (delta: 3.5MB). Peak memory consumption was 153.4MB. Max. memory is 8.0GB. [2023-12-15 21:29:58,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 151.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.53ms. Allocated memory is still 198.2MB. Free memory was 148.1MB in the beginning and 131.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.60ms. Allocated memory is still 198.2MB. Free memory was 131.9MB in the beginning and 127.4MB in the end (delta: 4.4MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.77ms. Allocated memory is still 198.2MB. Free memory was 127.4MB in the beginning and 122.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 698.60ms. Allocated memory is still 198.2MB. Free memory was 122.2MB in the beginning and 140.0MB in the end (delta: -17.8MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6101.04ms. Allocated memory was 198.2MB in the beginning and 348.1MB in the end (delta: 149.9MB). Free memory was 138.9MB in the beginning and 135.5MB in the end (delta: 3.5MB). Peak memory consumption was 153.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L22-L24] float float_Array_0[2][3] = { {99.5, 255.9, 255.75}, {4.75, 24.85, 63.75} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L25-L27] signed char signed_char_Array_0[2][2] = { {-10, 10}, {4, 1} }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { -2, 1629954775, 1928642731 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 5 }; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] float_Array_0[0][0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L61] EXPR float_Array_0[0][0] [L61] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L61] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] float_Array_0[0][1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F [L63] EXPR float_Array_0[0][1] [L63] EXPR float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR (float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854765600e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] float_Array_0[0][2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F [L65] EXPR float_Array_0[0][2] [L65] EXPR float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not((float_Array_0[0][2] >= 0.0F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] float_Array_0[1][2] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F [L67] EXPR float_Array_0[1][2] [L67] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 9223372.036854776000e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L69] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L72] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L75] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR signed_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L78] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 1073741822) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR signed_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[2] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR signed_long_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 2147483646) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L40] signed long int stepLocal_0 = -4; [L41] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L41] COND TRUE stepLocal_0 < signed_char_Array_0[1][0] [L42] EXPR float_Array_0[0][0] [L42] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L42] EXPR float_Array_0[0][0] [L42] EXPR ((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-4, unsigned_short_int_Array_0={8:0}] [L42] float_Array_0[1][0] = ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L44] EXPR float_Array_0[0][0] [L44] EXPR float_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) [L44] EXPR float_Array_0[0][0] [L44] EXPR ((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-4, unsigned_short_int_Array_0={8:0}] [L44] float_Array_0[1][1] = ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))) [L45] EXPR signed_char_Array_0[0][1] [L45] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L46] EXPR signed_char_Array_0[1][0] [L46] unsigned_short_int_Array_0[0] = signed_char_Array_0[1][0] [L47] EXPR float_Array_0[1][2] [L47] EXPR float_Array_0[0][2] [L47] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L47] COND FALSE !((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) [L50] EXPR signed_char_Array_0[0][1] [L50] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L52] EXPR signed_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1][0] | 5 VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-4, unsigned_short_int_Array_0={8:0}] [L52] signed long int stepLocal_1 = signed_char_Array_0[1][0] | 5; [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) [L53] EXPR signed_char_Array_0[0][1] [L53] EXPR ((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-4, stepLocal_1=5, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(stepLocal_1 <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) [L56] EXPR signed_char_Array_0[1][0] [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-4, stepLocal_1=5, unsigned_short_int_Array_0={8:0}] [L56] EXPR unsigned_short_int_Array_0[0] [L56] signed_long_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0])) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR float_Array_0[1][2] [L87] EXPR float_Array_0[0][2] [L87] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L87] EXPR signed_char_Array_0[1][1] [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR signed_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) [L87] EXPR signed_char_Array_0[0][1] [L87] EXPR signed_char_Array_0[1][0] [L87] EXPR (((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[0]))))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (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) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR ((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (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) signed_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (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) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (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) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87-L88] return (((((((float_Array_0[1][2] - float_Array_0[0][2]) <= (- float_Array_0[1][0])) ? (signed_char_Array_0[1][1] == ((signed char) (((((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) < (signed_char_Array_0[0][0])) ? ((signed_char_Array_0[0][1] - signed_char_Array_0[1][0])) : (signed_char_Array_0[0][0]))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && ((-4 < signed_char_Array_0[1][0]) ? (float_Array_0[1][0] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1]))))) : 1)) && (float_Array_0[1][1] == ((float) ((((float_Array_0[0][0]) > (float_Array_0[0][1])) ? (float_Array_0[0][0]) : (float_Array_0[0][1])))))) && (((signed_char_Array_0[1][0] | 5) <= ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0])))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((signed_char_Array_0[1][0]) < ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0]))) ? (signed_char_Array_0[1][0]) : ((signed_long_int_Array_0[1] - unsigned_short_int_Array_0[0])))) - (signed_long_int_Array_0[2] - ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1]))))))) : (signed_long_int_Array_0[0] == ((signed long int) (signed_char_Array_0[1][0] + (((((unsigned_short_int_Array_0[0]) < (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) signed_char_Array_0[0][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[1][0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1674 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1667 mSDsluCounter, 5010 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3569 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1665 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 1441 mSDtfsCounter, 1665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=623occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 173 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 3213 SizeOfPredicates, 5 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3941/4004 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 [2023-12-15 21:29:58,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...