/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:18:02,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:18:02,834 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-16 04:18:02,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:18:02,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:18:02,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:18:02,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:18:02,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:18:02,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:18:02,873 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:18:02,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:18:02,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:18:02,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:18:02,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:18:02,875 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:18:02,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:18:02,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:18:02,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:18:02,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:18:02,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:18:02,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:18:02,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:18:02,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:18:02,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:18:02,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:18:02,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:18:02,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:18:02,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:18:02,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:18:02,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:18:02,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:18:02,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:18:02,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:02,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:18:02,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:18:02,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:18:02,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:18:02,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:18:02,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:18:02,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:18:02,882 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:18:02,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:18:02,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:18:02,883 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 -> false [2023-12-16 04:18:03,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:18:03,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:18:03,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:18:03,140 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:18:03,140 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:18:03,141 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-13.i [2023-12-16 04:18:04,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:18:05,060 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:18:05,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2023-12-16 04:18:05,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a878147/372e06ae171e4ec0a1090941ff568020/FLAG02a2f1606 [2023-12-16 04:18:05,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a878147/372e06ae171e4ec0a1090941ff568020 [2023-12-16 04:18:05,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:18:05,089 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:18:05,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:05,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:18:05,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:18:05,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7ba88c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05, skipping insertion in model container [2023-12-16 04:18:05,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,128 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:18:05,255 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-13.i[916,929] [2023-12-16 04:18:05,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:05,366 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:18:05,376 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-13.i[916,929] [2023-12-16 04:18:05,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:05,426 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:18:05,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05 WrapperNode [2023-12-16 04:18:05,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:05,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:05,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:18:05,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:18:05,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,490 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2023-12-16 04:18:05,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:05,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:18:05,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:18:05,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:18:05,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,531 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2023-12-16 04:18:05,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:18:05,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:18:05,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:18:05,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:18:05,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (1/1) ... [2023-12-16 04:18:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:05,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:05,599 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-16 04:18:05,643 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-16 04:18:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:18:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:18:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:18:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:18:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:18:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:18:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:18:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:18:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:18:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:18:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:18:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:18:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:18:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:18:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:18:05,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:18:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:18:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:18:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:18:05,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:18:05,819 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:18:05,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:18:06,211 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:18:06,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:18:06,258 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:18:06,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:06 BoogieIcfgContainer [2023-12-16 04:18:06,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:18:06,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:18:06,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:18:06,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:18:06,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:05" (1/3) ... [2023-12-16 04:18:06,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39a52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:06, skipping insertion in model container [2023-12-16 04:18:06,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:05" (2/3) ... [2023-12-16 04:18:06,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f39a52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:06, skipping insertion in model container [2023-12-16 04:18:06,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:06" (3/3) ... [2023-12-16 04:18:06,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-13.i [2023-12-16 04:18:06,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:18:06,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:18:06,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:18:06,338 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;@548dcede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:18:06,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:18:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:18:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:18:06,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:06,360 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:06,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:06,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1643118379, now seen corresponding path program 1 times [2023-12-16 04:18:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663071257] [2023-12-16 04:18:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:06,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663071257] [2023-12-16 04:18:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663071257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:06,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:06,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:18:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852248393] [2023-12-16 04:18:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:06,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:18:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:06,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:18:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:06,818 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:06,877 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2023-12-16 04:18:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:18:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-12-16 04:18:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:06,890 INFO L225 Difference]: With dead ends: 207 [2023-12-16 04:18:06,890 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 04:18:06,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 04:18:06,896 INFO L413 NwaCegarLoop]: 150 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, 150 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-16 04:18:06,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 04:18:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-16 04:18:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:18:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2023-12-16 04:18:06,939 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2023-12-16 04:18:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:06,940 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2023-12-16 04:18:06,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2023-12-16 04:18:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:18:06,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:06,943 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:18:06,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:06,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1226582997, now seen corresponding path program 1 times [2023-12-16 04:18:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:06,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918944665] [2023-12-16 04:18:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918944665] [2023-12-16 04:18:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918944665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:07,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455597419] [2023-12-16 04:18:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:07,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:07,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:07,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:07,308 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:07,389 INFO L93 Difference]: Finished difference Result 211 states and 316 transitions. [2023-12-16 04:18:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-12-16 04:18:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:07,391 INFO L225 Difference]: With dead ends: 211 [2023-12-16 04:18:07,392 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 04:18:07,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 04:18:07,394 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 10 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:07,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 442 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 04:18:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2023-12-16 04:18:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:18:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2023-12-16 04:18:07,411 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2023-12-16 04:18:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:07,412 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2023-12-16 04:18:07,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2023-12-16 04:18:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:18:07,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:07,414 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:07,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:18:07,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:07,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 755226647, now seen corresponding path program 1 times [2023-12-16 04:18:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:07,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655769142] [2023-12-16 04:18:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655769142] [2023-12-16 04:18:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655769142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818850961] [2023-12-16 04:18:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:07,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:07,829 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:07,947 INFO L93 Difference]: Finished difference Result 231 states and 345 transitions. [2023-12-16 04:18:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-16 04:18:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:07,955 INFO L225 Difference]: With dead ends: 231 [2023-12-16 04:18:07,955 INFO L226 Difference]: Without dead ends: 127 [2023-12-16 04:18:07,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-16 04:18:07,963 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 41 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:07,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 483 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-16 04:18:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2023-12-16 04:18:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:18:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2023-12-16 04:18:07,998 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 126 [2023-12-16 04:18:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:08,001 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2023-12-16 04:18:08,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2023-12-16 04:18:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:18:08,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:08,009 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:08,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:18:08,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:08,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash 961133180, now seen corresponding path program 1 times [2023-12-16 04:18:08,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854166204] [2023-12-16 04:18:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854166204] [2023-12-16 04:18:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854166204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962650985] [2023-12-16 04:18:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:08,566 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:08,680 INFO L93 Difference]: Finished difference Result 319 states and 472 transitions. [2023-12-16 04:18:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:18:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 04:18:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:08,682 INFO L225 Difference]: With dead ends: 319 [2023-12-16 04:18:08,683 INFO L226 Difference]: Without dead ends: 213 [2023-12-16 04:18:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 04:18:08,684 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 102 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:08,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 407 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-16 04:18:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2023-12-16 04:18:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.4204545454545454) internal successors, (250), 176 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2023-12-16 04:18:08,719 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 128 [2023-12-16 04:18:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:08,720 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2023-12-16 04:18:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2023-12-16 04:18:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:18:08,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:08,727 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:08,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:18:08,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:08,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash -727810562, now seen corresponding path program 1 times [2023-12-16 04:18:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61172805] [2023-12-16 04:18:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:08,768 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:08,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543186497] [2023-12-16 04:18:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:08,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:08,776 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-16 04:18:08,788 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-16 04:18:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:09,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 04:18:09,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:09,212 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 35 treesize of output 23 [2023-12-16 04:18:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:09,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61172805] [2023-12-16 04:18:09,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543186497] [2023-12-16 04:18:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543186497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:09,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:09,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442066717] [2023-12-16 04:18:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:09,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:09,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:09,231 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:09,298 INFO L93 Difference]: Finished difference Result 462 states and 685 transitions. [2023-12-16 04:18:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:09,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 04:18:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:09,303 INFO L225 Difference]: With dead ends: 462 [2023-12-16 04:18:09,303 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 04:18:09,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:09,305 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 58 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:09,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 573 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 04:18:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2023-12-16 04:18:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 181 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2023-12-16 04:18:09,337 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 128 [2023-12-16 04:18:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:09,339 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2023-12-16 04:18:09,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2023-12-16 04:18:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:18:09,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:09,341 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:09,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:09,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:09,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:09,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1748878916, now seen corresponding path program 1 times [2023-12-16 04:18:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318747296] [2023-12-16 04:18:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:09,584 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322871142] [2023-12-16 04:18:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:09,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:09,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:09,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:09,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:18:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:09,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 04:18:09,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:09,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 04:18:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:09,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318747296] [2023-12-16 04:18:09,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322871142] [2023-12-16 04:18:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322871142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:09,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342076948] [2023-12-16 04:18:09,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:09,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:09,883 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:09,946 INFO L93 Difference]: Finished difference Result 479 states and 708 transitions. [2023-12-16 04:18:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 04:18:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:09,948 INFO L225 Difference]: With dead ends: 479 [2023-12-16 04:18:09,948 INFO L226 Difference]: Without dead ends: 266 [2023-12-16 04:18:09,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:09,950 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 114 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:09,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 600 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-16 04:18:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 218. [2023-12-16 04:18:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 185 states have internal predecessors, (261), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 321 transitions. [2023-12-16 04:18:09,969 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 321 transitions. Word has length 128 [2023-12-16 04:18:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:09,970 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 321 transitions. [2023-12-16 04:18:09,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2023-12-16 04:18:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:18:09,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:09,971 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:09,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:10,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-16 04:18:10,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:10,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1611336372, now seen corresponding path program 1 times [2023-12-16 04:18:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891593022] [2023-12-16 04:18:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:10,213 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352449551] [2023-12-16 04:18:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:10,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:10,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:10,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:10,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:18:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:10,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 04:18:10,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:10,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891593022] [2023-12-16 04:18:10,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352449551] [2023-12-16 04:18:10,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352449551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:10,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:10,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016479058] [2023-12-16 04:18:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:10,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:10,494 INFO L87 Difference]: Start difference. First operand 218 states and 321 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:10,663 INFO L93 Difference]: Finished difference Result 606 states and 895 transitions. [2023-12-16 04:18:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-16 04:18:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:10,666 INFO L225 Difference]: With dead ends: 606 [2023-12-16 04:18:10,666 INFO L226 Difference]: Without dead ends: 389 [2023-12-16 04:18:10,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:10,667 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 191 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:10,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 594 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-16 04:18:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 233. [2023-12-16 04:18:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.42) internal successors, (284), 200 states have internal predecessors, (284), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:18:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 344 transitions. [2023-12-16 04:18:10,682 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 344 transitions. Word has length 129 [2023-12-16 04:18:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:10,682 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 344 transitions. [2023-12-16 04:18:10,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2023-12-16 04:18:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:18:10,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:10,684 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:10,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:10,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:10,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:10,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2004363382, now seen corresponding path program 1 times [2023-12-16 04:18:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560334341] [2023-12-16 04:18:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:10,921 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931910492] [2023-12-16 04:18:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:10,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:10,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:10,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:18:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:11,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 04:18:11,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:11,379 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 15 treesize of output 15 [2023-12-16 04:18:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:11,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560334341] [2023-12-16 04:18:11,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931910492] [2023-12-16 04:18:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931910492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645476168] [2023-12-16 04:18:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:11,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:18:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:11,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:18:11,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:11,473 INFO L87 Difference]: Start difference. First operand 233 states and 344 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:11,822 INFO L93 Difference]: Finished difference Result 678 states and 999 transitions. [2023-12-16 04:18:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:18:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-16 04:18:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:11,825 INFO L225 Difference]: With dead ends: 678 [2023-12-16 04:18:11,826 INFO L226 Difference]: Without dead ends: 446 [2023-12-16 04:18:11,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:18:11,827 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 464 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:11,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1069 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-12-16 04:18:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 337. [2023-12-16 04:18:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 292 states have (on average 1.4075342465753424) internal successors, (411), 293 states have internal predecessors, (411), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 04:18:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 491 transitions. [2023-12-16 04:18:11,848 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 491 transitions. Word has length 129 [2023-12-16 04:18:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:11,849 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 491 transitions. [2023-12-16 04:18:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 491 transitions. [2023-12-16 04:18:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:18:11,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:11,850 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:11,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:12,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:12,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1324305012, now seen corresponding path program 1 times [2023-12-16 04:18:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:12,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026939520] [2023-12-16 04:18:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:12,086 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851732208] [2023-12-16 04:18:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:12,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:12,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:18:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:12,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:18:12,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:12,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026939520] [2023-12-16 04:18:12,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851732208] [2023-12-16 04:18:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851732208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:12,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138283846] [2023-12-16 04:18:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:12,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:12,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:12,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:12,371 INFO L87 Difference]: Start difference. First operand 337 states and 491 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:12,594 INFO L93 Difference]: Finished difference Result 732 states and 1066 transitions. [2023-12-16 04:18:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:12,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-16 04:18:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:12,597 INFO L225 Difference]: With dead ends: 732 [2023-12-16 04:18:12,597 INFO L226 Difference]: Without dead ends: 396 [2023-12-16 04:18:12,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:12,598 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 176 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:12,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 766 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-16 04:18:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 345. [2023-12-16 04:18:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 297 states have (on average 1.3973063973063973) internal successors, (415), 298 states have internal predecessors, (415), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:18:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 499 transitions. [2023-12-16 04:18:12,620 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 499 transitions. Word has length 129 [2023-12-16 04:18:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:12,620 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 499 transitions. [2023-12-16 04:18:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 499 transitions. [2023-12-16 04:18:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:18:12,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:12,622 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:12,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:12,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:12,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:12,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash 601660172, now seen corresponding path program 1 times [2023-12-16 04:18:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:12,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505632009] [2023-12-16 04:18:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:12,888 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099003420] [2023-12-16 04:18:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:12,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:12,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:12,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:18:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:13,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:18:13,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:13,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505632009] [2023-12-16 04:18:13,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099003420] [2023-12-16 04:18:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099003420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750144658] [2023-12-16 04:18:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:13,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:13,436 INFO L87 Difference]: Start difference. First operand 345 states and 499 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:13,679 INFO L93 Difference]: Finished difference Result 842 states and 1222 transitions. [2023-12-16 04:18:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:13,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-16 04:18:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:13,683 INFO L225 Difference]: With dead ends: 842 [2023-12-16 04:18:13,684 INFO L226 Difference]: Without dead ends: 498 [2023-12-16 04:18:13,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:13,685 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 195 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:13,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 599 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-16 04:18:13,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 443. [2023-12-16 04:18:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 382 states have (on average 1.3979057591623036) internal successors, (534), 384 states have internal predecessors, (534), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:18:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 642 transitions. [2023-12-16 04:18:13,711 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 642 transitions. Word has length 129 [2023-12-16 04:18:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:13,711 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 642 transitions. [2023-12-16 04:18:13,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 642 transitions. [2023-12-16 04:18:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:18:13,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:13,713 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:13,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:13,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:13,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:13,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1281718542, now seen corresponding path program 1 times [2023-12-16 04:18:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344794931] [2023-12-16 04:18:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:13,943 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715868649] [2023-12-16 04:18:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:13,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:13,945 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:13,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:18:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 04:18:14,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:14,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 04:18:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:14,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344794931] [2023-12-16 04:18:14,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715868649] [2023-12-16 04:18:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715868649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108405889] [2023-12-16 04:18:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:14,188 INFO L87 Difference]: Start difference. First operand 443 states and 642 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:14,339 INFO L93 Difference]: Finished difference Result 996 states and 1444 transitions. [2023-12-16 04:18:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:18:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-12-16 04:18:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:14,342 INFO L225 Difference]: With dead ends: 996 [2023-12-16 04:18:14,343 INFO L226 Difference]: Without dead ends: 554 [2023-12-16 04:18:14,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:18:14,344 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 222 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:14,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1199 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2023-12-16 04:18:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 508. [2023-12-16 04:18:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 430 states have (on average 1.3813953488372093) internal successors, (594), 433 states have internal predecessors, (594), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-16 04:18:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 732 transitions. [2023-12-16 04:18:14,374 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 732 transitions. Word has length 129 [2023-12-16 04:18:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:14,374 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 732 transitions. [2023-12-16 04:18:14,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 732 transitions. [2023-12-16 04:18:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:18:14,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:14,376 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:14,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:14,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:14,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:14,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1279912777, now seen corresponding path program 1 times [2023-12-16 04:18:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843365715] [2023-12-16 04:18:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:14,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843365715] [2023-12-16 04:18:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843365715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073908067] [2023-12-16 04:18:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:14,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:14,938 INFO L87 Difference]: Start difference. First operand 508 states and 732 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:15,003 INFO L93 Difference]: Finished difference Result 1052 states and 1514 transitions. [2023-12-16 04:18:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:18:15,004 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-12-16 04:18:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:15,009 INFO L225 Difference]: With dead ends: 1052 [2023-12-16 04:18:15,009 INFO L226 Difference]: Without dead ends: 595 [2023-12-16 04:18:15,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:15,011 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:15,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 459 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-16 04:18:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 508. [2023-12-16 04:18:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 430 states have (on average 1.372093023255814) internal successors, (590), 433 states have internal predecessors, (590), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-16 04:18:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 728 transitions. [2023-12-16 04:18:15,051 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 728 transitions. Word has length 130 [2023-12-16 04:18:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:15,051 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 728 transitions. [2023-12-16 04:18:15,051 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 728 transitions. [2023-12-16 04:18:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:18:15,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:15,053 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:15,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:18:15,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:15,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -578848199, now seen corresponding path program 1 times [2023-12-16 04:18:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349994033] [2023-12-16 04:18:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:18:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:18:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 04:18:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:18:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:18:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:18:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:18:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:18:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:18:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:18:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:18:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:18:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:18:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:18:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:18:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349994033] [2023-12-16 04:18:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349994033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172930952] [2023-12-16 04:18:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:15,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:15,557 INFO L87 Difference]: Start difference. First operand 508 states and 728 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:15,894 INFO L93 Difference]: Finished difference Result 1597 states and 2275 transitions. [2023-12-16 04:18:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:18:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-12-16 04:18:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:15,900 INFO L225 Difference]: With dead ends: 1597 [2023-12-16 04:18:15,900 INFO L226 Difference]: Without dead ends: 1140 [2023-12-16 04:18:15,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:18:15,902 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 333 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:15,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1267 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-12-16 04:18:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1124. [2023-12-16 04:18:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 951 states have (on average 1.3638275499474237) internal successors, (1297), 957 states have internal predecessors, (1297), 153 states have call successors, (153), 19 states have call predecessors, (153), 19 states have return successors, (153), 147 states have call predecessors, (153), 153 states have call successors, (153) [2023-12-16 04:18:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1603 transitions. [2023-12-16 04:18:15,976 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1603 transitions. Word has length 130 [2023-12-16 04:18:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:15,976 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1603 transitions. [2023-12-16 04:18:15,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1603 transitions. [2023-12-16 04:18:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:18:15,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:15,979 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:15,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:18:15,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:15,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2027175355, now seen corresponding path program 1 times [2023-12-16 04:18:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:15,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941568254] [2023-12-16 04:18:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:16,011 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414025334] [2023-12-16 04:18:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:16,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:16,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:16,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:16,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:18:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:18:16,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:16,244 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-16 04:18:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:16,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941568254] [2023-12-16 04:18:16,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414025334] [2023-12-16 04:18:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414025334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:16,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83878848] [2023-12-16 04:18:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:16,252 INFO L87 Difference]: Start difference. First operand 1124 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:16,345 INFO L93 Difference]: Finished difference Result 2197 states and 3132 transitions. [2023-12-16 04:18:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-12-16 04:18:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:16,353 INFO L225 Difference]: With dead ends: 2197 [2023-12-16 04:18:16,353 INFO L226 Difference]: Without dead ends: 1124 [2023-12-16 04:18:16,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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-16 04:18:16,357 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:16,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 291 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-12-16 04:18:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2023-12-16 04:18:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 951 states have (on average 1.3617245005257623) internal successors, (1295), 957 states have internal predecessors, (1295), 153 states have call successors, (153), 19 states have call predecessors, (153), 19 states have return successors, (153), 147 states have call predecessors, (153), 153 states have call successors, (153) [2023-12-16 04:18:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1601 transitions. [2023-12-16 04:18:16,424 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1601 transitions. Word has length 130 [2023-12-16 04:18:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:16,425 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1601 transitions. [2023-12-16 04:18:16,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1601 transitions. [2023-12-16 04:18:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 04:18:16,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:16,427 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:16,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-16 04:18:16,637 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:16,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2048937223, now seen corresponding path program 1 times [2023-12-16 04:18:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:16,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436962725] [2023-12-16 04:18:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:16,679 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340641517] [2023-12-16 04:18:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:16,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:16,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 04:18:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:16,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 04:18:16,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:17,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-16 04:18:17,070 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 25 treesize of output 13 [2023-12-16 04:18:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 04:18:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:18:17,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:18:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:17,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436962725] [2023-12-16 04:18:17,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340641517] [2023-12-16 04:18:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340641517] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:18:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:18:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2023-12-16 04:18:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055226925] [2023-12-16 04:18:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:17,387 INFO L87 Difference]: Start difference. First operand 1124 states and 1601 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:17,882 INFO L93 Difference]: Finished difference Result 2712 states and 3847 transitions. [2023-12-16 04:18:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:18:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-12-16 04:18:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:17,890 INFO L225 Difference]: With dead ends: 2712 [2023-12-16 04:18:17,890 INFO L226 Difference]: Without dead ends: 1639 [2023-12-16 04:18:17,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:18:17,895 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 252 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:17,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1502 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2023-12-16 04:18:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1244. [2023-12-16 04:18:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1053 states have (on average 1.3570750237416904) internal successors, (1429), 1059 states have internal predecessors, (1429), 168 states have call successors, (168), 22 states have call predecessors, (168), 22 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2023-12-16 04:18:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1765 transitions. [2023-12-16 04:18:18,020 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1765 transitions. Word has length 130 [2023-12-16 04:18:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,020 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1765 transitions. [2023-12-16 04:18:18,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1765 transitions. [2023-12-16 04:18:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-16 04:18:18,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,022 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:18,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:18,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-16 04:18:18,231 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:18,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1414655311, now seen corresponding path program 1 times [2023-12-16 04:18:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804159023] [2023-12-16 04:18:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:18,270 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:18,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925889504] [2023-12-16 04:18:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:18,272 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:18,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-16 04:18:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 04:18:18,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:18,518 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 18 treesize of output 10 [2023-12-16 04:18:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:18,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804159023] [2023-12-16 04:18:18,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925889504] [2023-12-16 04:18:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925889504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528579601] [2023-12-16 04:18:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:18,530 INFO L87 Difference]: Start difference. First operand 1244 states and 1765 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:18,624 INFO L93 Difference]: Finished difference Result 2457 states and 3480 transitions. [2023-12-16 04:18:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-12-16 04:18:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:18,631 INFO L225 Difference]: With dead ends: 2457 [2023-12-16 04:18:18,631 INFO L226 Difference]: Without dead ends: 1404 [2023-12-16 04:18:18,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:18,634 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:18,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2023-12-16 04:18:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1244. [2023-12-16 04:18:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1053 states have (on average 1.3513770180436848) internal successors, (1423), 1059 states have internal predecessors, (1423), 168 states have call successors, (168), 22 states have call predecessors, (168), 22 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2023-12-16 04:18:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1759 transitions. [2023-12-16 04:18:18,716 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1759 transitions. Word has length 131 [2023-12-16 04:18:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,717 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1759 transitions. [2023-12-16 04:18:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1759 transitions. [2023-12-16 04:18:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 04:18:18,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,720 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:18,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:18,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-16 04:18:18,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:18,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1378580438, now seen corresponding path program 1 times [2023-12-16 04:18:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177847608] [2023-12-16 04:18:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:18,953 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150378075] [2023-12-16 04:18:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:18,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-16 04:18:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 04:18:19,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:19,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177847608] [2023-12-16 04:18:19,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150378075] [2023-12-16 04:18:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150378075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595091595] [2023-12-16 04:18:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:19,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:19,252 INFO L87 Difference]: Start difference. First operand 1244 states and 1759 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:19,461 INFO L93 Difference]: Finished difference Result 2117 states and 2982 transitions. [2023-12-16 04:18:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2023-12-16 04:18:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:19,466 INFO L225 Difference]: With dead ends: 2117 [2023-12-16 04:18:19,467 INFO L226 Difference]: Without dead ends: 1064 [2023-12-16 04:18:19,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:19,470 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 157 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:19,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 866 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2023-12-16 04:18:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 658. [2023-12-16 04:18:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 561 states have (on average 1.3422459893048129) internal successors, (753), 563 states have internal predecessors, (753), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-16 04:18:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 921 transitions. [2023-12-16 04:18:19,520 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 921 transitions. Word has length 133 [2023-12-16 04:18:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:19,520 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 921 transitions. [2023-12-16 04:18:19,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 921 transitions. [2023-12-16 04:18:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:18:19,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:19,522 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:19,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:19,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-16 04:18:19,733 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 77086091, now seen corresponding path program 1 times [2023-12-16 04:18:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621042548] [2023-12-16 04:18:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,768 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:19,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014794368] [2023-12-16 04:18:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:19,770 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 04:18:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:18:20,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:20,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621042548] [2023-12-16 04:18:20,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014794368] [2023-12-16 04:18:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014794368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424190583] [2023-12-16 04:18:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:20,044 INFO L87 Difference]: Start difference. First operand 658 states and 921 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,120 INFO L93 Difference]: Finished difference Result 1363 states and 1907 transitions. [2023-12-16 04:18:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2023-12-16 04:18:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,124 INFO L225 Difference]: With dead ends: 1363 [2023-12-16 04:18:20,124 INFO L226 Difference]: Without dead ends: 706 [2023-12-16 04:18:20,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:20,126 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 689 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-12-16 04:18:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 682. [2023-12-16 04:18:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 585 states have (on average 1.3282051282051281) internal successors, (777), 587 states have internal predecessors, (777), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-16 04:18:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 945 transitions. [2023-12-16 04:18:20,168 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 945 transitions. Word has length 134 [2023-12-16 04:18:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,169 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 945 transitions. [2023-12-16 04:18:20,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 945 transitions. [2023-12-16 04:18:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-16 04:18:20,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,170 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:20,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:20,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 04:18:20,371 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -65045251, now seen corresponding path program 1 times [2023-12-16 04:18:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22354061] [2023-12-16 04:18:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,401 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610967647] [2023-12-16 04:18:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:20,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-16 04:18:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 04:18:20,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:20,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22354061] [2023-12-16 04:18:20,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610967647] [2023-12-16 04:18:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610967647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504990379] [2023-12-16 04:18:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:20,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:20,765 INFO L87 Difference]: Start difference. First operand 682 states and 945 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,833 INFO L93 Difference]: Finished difference Result 1351 states and 1871 transitions. [2023-12-16 04:18:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:20,834 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2023-12-16 04:18:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,837 INFO L225 Difference]: With dead ends: 1351 [2023-12-16 04:18:20,837 INFO L226 Difference]: Without dead ends: 670 [2023-12-16 04:18:20,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 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-16 04:18:20,839 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2023-12-16 04:18:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2023-12-16 04:18:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 573 states have (on average 1.3141361256544504) internal successors, (753), 575 states have internal predecessors, (753), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-16 04:18:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 921 transitions. [2023-12-16 04:18:20,949 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 921 transitions. Word has length 134 [2023-12-16 04:18:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,950 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 921 transitions. [2023-12-16 04:18:20,950 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 921 transitions. [2023-12-16 04:18:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:18:20,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,952 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:20,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:21,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,161 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:21,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1383739920, now seen corresponding path program 1 times [2023-12-16 04:18:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363937694] [2023-12-16 04:18:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:21,192 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:21,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578702986] [2023-12-16 04:18:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:21,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:21,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-16 04:18:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:21,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 04:18:21,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:21,489 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 35 treesize of output 23 [2023-12-16 04:18:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:21,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363937694] [2023-12-16 04:18:21,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:21,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578702986] [2023-12-16 04:18:21,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578702986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:21,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:21,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:21,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395299456] [2023-12-16 04:18:21,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:21,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:21,500 INFO L87 Difference]: Start difference. First operand 670 states and 921 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:21,568 INFO L93 Difference]: Finished difference Result 1476 states and 2012 transitions. [2023-12-16 04:18:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2023-12-16 04:18:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:21,572 INFO L225 Difference]: With dead ends: 1476 [2023-12-16 04:18:21,572 INFO L226 Difference]: Without dead ends: 807 [2023-12-16 04:18:21,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:21,575 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 35 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:21,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 544 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2023-12-16 04:18:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 710. [2023-12-16 04:18:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 613 states have (on average 1.2920065252854813) internal successors, (792), 615 states have internal predecessors, (792), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-16 04:18:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 960 transitions. [2023-12-16 04:18:21,615 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 960 transitions. Word has length 136 [2023-12-16 04:18:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:21,615 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 960 transitions. [2023-12-16 04:18:21,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 960 transitions. [2023-12-16 04:18:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:18:21,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:21,616 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:21,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:21,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,826 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:21,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574482, now seen corresponding path program 1 times [2023-12-16 04:18:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773541620] [2023-12-16 04:18:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:21,890 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108317856] [2023-12-16 04:18:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:21,900 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:21,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-16 04:18:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 04:18:22,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:22,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:22,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2023-12-16 04:18:22,472 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 20 treesize of output 12 [2023-12-16 04:18:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:22,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773541620] [2023-12-16 04:18:22,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108317856] [2023-12-16 04:18:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108317856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:22,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267853298] [2023-12-16 04:18:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:22,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:22,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:22,483 INFO L87 Difference]: Start difference. First operand 710 states and 960 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:22,690 INFO L93 Difference]: Finished difference Result 1871 states and 2513 transitions. [2023-12-16 04:18:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:22,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2023-12-16 04:18:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:22,695 INFO L225 Difference]: With dead ends: 1871 [2023-12-16 04:18:22,695 INFO L226 Difference]: Without dead ends: 1162 [2023-12-16 04:18:22,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:22,698 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 104 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:22,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 790 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-12-16 04:18:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1130. [2023-12-16 04:18:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 991 states have (on average 1.2764883955600403) internal successors, (1265), 999 states have internal predecessors, (1265), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-16 04:18:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1505 transitions. [2023-12-16 04:18:22,758 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1505 transitions. Word has length 136 [2023-12-16 04:18:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:22,758 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1505 transitions. [2023-12-16 04:18:22,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1505 transitions. [2023-12-16 04:18:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:18:22,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:22,760 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:22,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:22,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:22,968 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:22,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash 921524391, now seen corresponding path program 1 times [2023-12-16 04:18:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606251840] [2023-12-16 04:18:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:23,017 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116380080] [2023-12-16 04:18:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:23,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:23,018 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-16 04:18:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:23,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 04:18:23,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:23,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606251840] [2023-12-16 04:18:23,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116380080] [2023-12-16 04:18:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116380080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208723200] [2023-12-16 04:18:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:23,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:23,296 INFO L87 Difference]: Start difference. First operand 1130 states and 1505 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:23,359 INFO L93 Difference]: Finished difference Result 2237 states and 2976 transitions. [2023-12-16 04:18:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:23,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2023-12-16 04:18:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:23,364 INFO L225 Difference]: With dead ends: 2237 [2023-12-16 04:18:23,364 INFO L226 Difference]: Without dead ends: 1108 [2023-12-16 04:18:23,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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-16 04:18:23,369 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2023-12-16 04:18:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2023-12-16 04:18:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 969 states have (on average 1.2600619195046439) internal successors, (1221), 977 states have internal predecessors, (1221), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-16 04:18:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1461 transitions. [2023-12-16 04:18:23,428 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1461 transitions. Word has length 137 [2023-12-16 04:18:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:23,428 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1461 transitions. [2023-12-16 04:18:23,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1461 transitions. [2023-12-16 04:18:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:18:23,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:23,430 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:23,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:23,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-16 04:18:23,640 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:23,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 14606959, now seen corresponding path program 1 times [2023-12-16 04:18:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730775359] [2023-12-16 04:18:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:23,665 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:23,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681739251] [2023-12-16 04:18:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:23,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:23,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-16 04:18:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:23,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 04:18:23,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:23,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:18:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:18:24,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730775359] [2023-12-16 04:18:24,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681739251] [2023-12-16 04:18:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681739251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170850667] [2023-12-16 04:18:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:24,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:24,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:24,053 INFO L87 Difference]: Start difference. First operand 1108 states and 1461 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:24,418 INFO L93 Difference]: Finished difference Result 1199 states and 1573 transitions. [2023-12-16 04:18:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:24,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2023-12-16 04:18:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:24,433 INFO L225 Difference]: With dead ends: 1199 [2023-12-16 04:18:24,433 INFO L226 Difference]: Without dead ends: 1197 [2023-12-16 04:18:24,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:24,435 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 177 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:24,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1126 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-12-16 04:18:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1132. [2023-12-16 04:18:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 993 states have (on average 1.2507552870090635) internal successors, (1242), 1001 states have internal predecessors, (1242), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-16 04:18:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1482 transitions. [2023-12-16 04:18:24,515 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1482 transitions. Word has length 137 [2023-12-16 04:18:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:24,516 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1482 transitions. [2023-12-16 04:18:24,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:18:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1482 transitions. [2023-12-16 04:18:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:18:24,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:24,517 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:24,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:24,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:24,732 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:24,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 289366573, now seen corresponding path program 1 times [2023-12-16 04:18:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:24,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632962506] [2023-12-16 04:18:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:24,769 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796448005] [2023-12-16 04:18:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:24,773 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:24,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-16 04:18:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:25,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:18:25,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:25,413 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 45 treesize of output 27 [2023-12-16 04:18:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:18:25,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632962506] [2023-12-16 04:18:25,429 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796448005] [2023-12-16 04:18:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796448005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:25,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082886863] [2023-12-16 04:18:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:25,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:25,430 INFO L87 Difference]: Start difference. First operand 1132 states and 1482 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:25,715 INFO L93 Difference]: Finished difference Result 2097 states and 2740 transitions. [2023-12-16 04:18:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:18:25,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2023-12-16 04:18:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:25,720 INFO L225 Difference]: With dead ends: 2097 [2023-12-16 04:18:25,720 INFO L226 Difference]: Without dead ends: 966 [2023-12-16 04:18:25,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:18:25,723 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 195 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:25,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 718 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-12-16 04:18:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 952. [2023-12-16 04:18:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 833 states have (on average 1.2484993997599039) internal successors, (1040), 839 states have internal predecessors, (1040), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-16 04:18:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1244 transitions. [2023-12-16 04:18:25,769 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1244 transitions. Word has length 137 [2023-12-16 04:18:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:25,770 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1244 transitions. [2023-12-16 04:18:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:18:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1244 transitions. [2023-12-16 04:18:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-16 04:18:25,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:25,771 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:18:25,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:25,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:25,980 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:25,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash 624246705, now seen corresponding path program 1 times [2023-12-16 04:18:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819908991] [2023-12-16 04:18:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:25,999 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587973167] [2023-12-16 04:18:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:26,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:26,001 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:26,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-16 04:18:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:26,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:18:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:26,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:18:26,532 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:18:26,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:18:26,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:26,746 INFO L445 BasicCegarLoop]: Path program histogram: [1, 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-16 04:18:26,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:18:26,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:18:26 BoogieIcfgContainer [2023-12-16 04:18:26,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:18:26,830 INFO L158 Benchmark]: Toolchain (without parser) took 21741.20ms. Allocated memory was 238.0MB in the beginning and 413.1MB in the end (delta: 175.1MB). Free memory was 189.1MB in the beginning and 182.4MB in the end (delta: 6.7MB). Peak memory consumption was 182.3MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,830 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:18:26,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.64ms. Allocated memory is still 238.0MB. Free memory was 188.7MB in the beginning and 173.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.59ms. Allocated memory is still 238.0MB. Free memory was 173.8MB in the beginning and 169.8MB in the end (delta: 4.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,830 INFO L158 Benchmark]: Boogie Preprocessor took 75.25ms. Allocated memory is still 238.0MB. Free memory was 169.8MB in the beginning and 164.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,831 INFO L158 Benchmark]: RCFGBuilder took 691.54ms. Allocated memory is still 238.0MB. Free memory was 164.5MB in the beginning and 203.5MB in the end (delta: -38.9MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,831 INFO L158 Benchmark]: TraceAbstraction took 20568.89ms. Allocated memory was 238.0MB in the beginning and 413.1MB in the end (delta: 175.1MB). Free memory was 202.9MB in the beginning and 182.4MB in the end (delta: 20.6MB). Peak memory consumption was 195.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:26,832 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.13ms. Allocated memory is still 173.0MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 335.64ms. Allocated memory is still 238.0MB. Free memory was 188.7MB in the beginning and 173.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.59ms. Allocated memory is still 238.0MB. Free memory was 173.8MB in the beginning and 169.8MB in the end (delta: 4.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.25ms. Allocated memory is still 238.0MB. Free memory was 169.8MB in the beginning and 164.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 691.54ms. Allocated memory is still 238.0MB. Free memory was 164.5MB in the beginning and 203.5MB in the end (delta: -38.9MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20568.89ms. Allocated memory was 238.0MB in the beginning and 413.1MB in the end (delta: 175.1MB). Free memory was 202.9MB in the beginning and 182.4MB in the end (delta: 20.6MB). Peak memory consumption was 195.2MB. 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 someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] double_Array_0[0][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] double_Array_0[0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] double_Array_0[1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] EXPR double_Array_0[0][0] [L40] EXPR double_Array_0[1][0] [L40] EXPR double_Array_0[0][1] [L40] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L46] EXPR unsigned_short_int_Array_0[2] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L46] EXPR unsigned_char_Array_0[0] [L46] EXPR unsigned_short_int_Array_0[1] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] COND FALSE !((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) [L49] signed_char_Array_0[1][1] = 5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L52] EXPR BOOL_unsigned_char_Array_0[0] [L52] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, stepLocal_0=0, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_char_Array_0[0] [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, stepLocal_0=0, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND TRUE stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L54] COND FALSE !(stepLocal_1 < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1 [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) [L90] EXPR unsigned_short_int_Array_0[2] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_short_int_Array_0[1] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) [L90] EXPR signed_char_Array_0[1][1] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR signed_char_Array_0[0][0] [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L90] EXPR double_Array_0[0][0] [L90] EXPR double_Array_0[1][0] [L90] EXPR double_Array_0[0][1] [L90] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90-L91] return (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3028 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3014 mSDsluCounter, 16311 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11995 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2781 IncrementalHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 4316 mSDtfsCounter, 2781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2767 GetRequests, 2626 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=15, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1829 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3279 NumberOfCodeBlocks, 3279 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3247 ConstructedInterpolants, 0 QuantifiedInterpolants, 6751 SizeOfPredicates, 131 NumberOfNonLiveVariables, 8342 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 25 InterpolantComputations, 24 PerfectInterpolantSequences, 10458/10500 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-16 04:18:26,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...