/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:36:23,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:36:23,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:36:23,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:36:23,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:36:23,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:36:23,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:36:23,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:36:23,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:36:23,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:36:23,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:36:23,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:36:23,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:36:23,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:36:23,237 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:36:23,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:36:23,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:36:23,238 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:36:23,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:36:23,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:36:23,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:36:23,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:36:23,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:36:23,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:36:23,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:36:23,240 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:36:23,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:36:23,241 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:36:23,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:36:23,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:36:23,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:36:23,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:36:23,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:23,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:36:23,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:36:23,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:36:23,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:36:23,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:36:23,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:36:23,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:36:23,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:36:23,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:36:23,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:36:23,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:36:23,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:36:23,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:36:23,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:36:23,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:36:23,486 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:36:23,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2023-12-15 21:36:24,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:36:24,823 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:36:24,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2023-12-15 21:36:24,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f319faaf9/807a062e33ff457ca75d4cb17b644b72/FLAG5ea799763 [2023-12-15 21:36:24,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f319faaf9/807a062e33ff457ca75d4cb17b644b72 [2023-12-15 21:36:24,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:36:24,853 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:36:24,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:24,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:36:24,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:36:24,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:24" (1/1) ... [2023-12-15 21:36:24,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7800ece0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:24, skipping insertion in model container [2023-12-15 21:36:24,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:24" (1/1) ... [2023-12-15 21:36:24,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:36:25,038 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-p_file-2.i[915,928] [2023-12-15 21:36:25,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:25,109 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:36:25,118 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-p_file-2.i[915,928] [2023-12-15 21:36:25,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:25,159 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:36:25,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25 WrapperNode [2023-12-15 21:36:25,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:25,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:25,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:36:25,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:36:25,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,221 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2023-12-15 21:36:25,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:25,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:36:25,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:36:25,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:36:25,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,268 INFO L175 MemorySlicer]: Split 131 memory accesses to 11 slices as follows [2, 12, 14, 22, 16, 14, 12, 8, 7, 14, 10]. 17 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 3, 1, 1]. [2023-12-15 21:36:25,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:36:25,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:36:25,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:36:25,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:36:25,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (1/1) ... [2023-12-15 21:36:25,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:25,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:36:25,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:36:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:36:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-15 21:36:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:36:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:36:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:36:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-15 21:36:25,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:36:25,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 21:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 21:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 21:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 21:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:36:25,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:36:25,579 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:36:25,580 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:36:26,028 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:36:26,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:36:26,067 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:36:26,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:26 BoogieIcfgContainer [2023-12-15 21:36:26,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:36:26,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:36:26,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:36:26,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:36:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:36:24" (1/3) ... [2023-12-15 21:36:26,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780293f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:26, skipping insertion in model container [2023-12-15 21:36:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:25" (2/3) ... [2023-12-15 21:36:26,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780293f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:26, skipping insertion in model container [2023-12-15 21:36:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:26" (3/3) ... [2023-12-15 21:36:26,075 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-2.i [2023-12-15 21:36:26,090 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:36:26,090 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:36:26,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:36:26,149 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;@564c494a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:36:26,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:36:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 80 states have (on average 1.5125) internal successors, (121), 81 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:36:26,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:26,173 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:26,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:26,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1370846810, now seen corresponding path program 1 times [2023-12-15 21:36:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089484619] [2023-12-15 21:36:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:26,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089484619] [2023-12-15 21:36:26,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 21:36:26,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499852166] [2023-12-15 21:36:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:26,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:26,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:26,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:36:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:26,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 21:36:26,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-12-15 21:36:26,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499852166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:26,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:26,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:36:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556093331] [2023-12-15 21:36:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:26,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:36:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:26,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:36:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:36:26,791 INFO L87 Difference]: Start difference. First operand has 95 states, 80 states have (on average 1.5125) internal successors, (121), 81 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:36:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:26,845 INFO L93 Difference]: Finished difference Result 187 states and 300 transitions. [2023-12-15 21:36:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:36:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2023-12-15 21:36:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:26,856 INFO L225 Difference]: With dead ends: 187 [2023-12-15 21:36:26,856 INFO L226 Difference]: Without dead ends: 93 [2023-12-15 21:36:26,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:36:26,864 INFO L413 NwaCegarLoop]: 136 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, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:26,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-15 21:36:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-15 21:36:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2023-12-15 21:36:26,915 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 95 [2023-12-15 21:36:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:26,915 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2023-12-15 21:36:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:36:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2023-12-15 21:36:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:36:26,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:26,919 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:26,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:36:27,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 21:36:27,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:27,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash -683646162, now seen corresponding path program 1 times [2023-12-15 21:36:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353333503] [2023-12-15 21:36:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:27,201 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:27,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411474105] [2023-12-15 21:36:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:27,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:27,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:27,211 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-15 21:36:27,230 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-15 21:36:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:27,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 21:36:27,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:27,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:27,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353333503] [2023-12-15 21:36:27,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:27,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411474105] [2023-12-15 21:36:27,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411474105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:27,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635419994] [2023-12-15 21:36:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:27,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:36:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:36:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:27,505 INFO L87 Difference]: Start difference. First operand 93 states and 140 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:27,556 INFO L93 Difference]: Finished difference Result 186 states and 281 transitions. [2023-12-15 21:36:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:36:27,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2023-12-15 21:36:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:27,558 INFO L225 Difference]: With dead ends: 186 [2023-12-15 21:36:27,558 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 21:36:27,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:27,560 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:27,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 21:36:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-15 21:36:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2023-12-15 21:36:27,568 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 95 [2023-12-15 21:36:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:27,569 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2023-12-15 21:36:27,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2023-12-15 21:36:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:36:27,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:27,571 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:27,579 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-15 21:36:27,776 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,SelfDestructingSolverStorable1 [2023-12-15 21:36:27,777 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:27,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1270452176, now seen corresponding path program 1 times [2023-12-15 21:36:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120113984] [2023-12-15 21:36:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:27,826 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141877475] [2023-12-15 21:36:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:27,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:27,828 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-15 21:36:27,846 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-15 21:36:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:28,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:36:28,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-15 21:36:28,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120113984] [2023-12-15 21:36:28,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141877475] [2023-12-15 21:36:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141877475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:28,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:28,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:36:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57414513] [2023-12-15 21:36:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:28,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:36:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:36:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:36:28,079 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:36:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:28,116 INFO L93 Difference]: Finished difference Result 193 states and 290 transitions. [2023-12-15 21:36:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2023-12-15 21:36:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:28,118 INFO L225 Difference]: With dead ends: 193 [2023-12-15 21:36:28,118 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 21:36:28,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:28,119 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 400 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-15 21:36:28,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 400 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 21:36:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-12-15 21:36:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2023-12-15 21:36:28,134 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 95 [2023-12-15 21:36:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:28,134 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2023-12-15 21:36:28,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:36:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2023-12-15 21:36:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 21:36:28,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:28,136 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:28,144 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-15 21:36:28,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:28,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:28,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1198065618, now seen corresponding path program 1 times [2023-12-15 21:36:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735800468] [2023-12-15 21:36:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:28,384 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:28,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243640514] [2023-12-15 21:36:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:28,386 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-15 21:36:28,398 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-15 21:36:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:28,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:36:28,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:28,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735800468] [2023-12-15 21:36:28,636 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243640514] [2023-12-15 21:36:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243640514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:36:28,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642523420] [2023-12-15 21:36:28,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:28,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:36:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:36:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:36:28,640 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:28,678 INFO L93 Difference]: Finished difference Result 213 states and 319 transitions. [2023-12-15 21:36:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2023-12-15 21:36:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:28,680 INFO L225 Difference]: With dead ends: 213 [2023-12-15 21:36:28,681 INFO L226 Difference]: Without dead ends: 118 [2023-12-15 21:36:28,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:28,685 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 67 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 402 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-15 21:36:28,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 402 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-15 21:36:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2023-12-15 21:36:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2023-12-15 21:36:28,703 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2023-12-15 21:36:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:28,705 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2023-12-15 21:36:28,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2023-12-15 21:36:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:36:28,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:28,709 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:28,719 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-15 21:36:28,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:28,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:28,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -512162755, now seen corresponding path program 1 times [2023-12-15 21:36:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715599756] [2023-12-15 21:36:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:28,959 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486858886] [2023-12-15 21:36:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:28,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:28,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:28,964 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-15 21:36:28,980 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-15 21:36:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:29,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 21:36:29,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:29,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715599756] [2023-12-15 21:36:29,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486858886] [2023-12-15 21:36:29,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486858886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:29,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:29,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413332189] [2023-12-15 21:36:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:29,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:36:29,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:36:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:29,202 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:29,224 INFO L93 Difference]: Finished difference Result 237 states and 353 transitions. [2023-12-15 21:36:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:36:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-15 21:36:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:29,225 INFO L225 Difference]: With dead ends: 237 [2023-12-15 21:36:29,225 INFO L226 Difference]: Without dead ends: 140 [2023-12-15 21:36:29,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:29,227 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 57 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:29,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 267 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-15 21:36:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2023-12-15 21:36:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 101 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2023-12-15 21:36:29,232 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 98 [2023-12-15 21:36:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:29,233 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2023-12-15 21:36:29,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2023-12-15 21:36:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:36:29,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:29,234 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:29,247 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-15 21:36:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:29,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:29,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -442669353, now seen corresponding path program 1 times [2023-12-15 21:36:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:29,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096274488] [2023-12-15 21:36:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:29,484 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028890153] [2023-12-15 21:36:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:29,496 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-15 21:36:29,500 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-15 21:36:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:29,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 21:36:29,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:29,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096274488] [2023-12-15 21:36:29,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028890153] [2023-12-15 21:36:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028890153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:29,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:29,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329253740] [2023-12-15 21:36:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:29,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:36:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:29,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:36:29,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:29,706 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:29,745 INFO L93 Difference]: Finished difference Result 240 states and 359 transitions. [2023-12-15 21:36:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:36:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-15 21:36:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:29,746 INFO L225 Difference]: With dead ends: 240 [2023-12-15 21:36:29,746 INFO L226 Difference]: Without dead ends: 126 [2023-12-15 21:36:29,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:36:29,747 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:29,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 265 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:36:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-15 21:36:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2023-12-15 21:36:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 102 states have internal predecessors, (149), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:36:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2023-12-15 21:36:29,753 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 98 [2023-12-15 21:36:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:29,753 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2023-12-15 21:36:29,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2023-12-15 21:36:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 21:36:29,754 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:29,755 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:29,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-15 21:36:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:29,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:29,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1252015979, now seen corresponding path program 1 times [2023-12-15 21:36:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72720500] [2023-12-15 21:36:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:30,003 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020246286] [2023-12-15 21:36:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:30,004 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-15 21:36:30,024 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-15 21:36:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:30,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-15 21:36:30,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:30,246 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 15 treesize of output 11 [2023-12-15 21:36:30,300 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 52 treesize of output 40 [2023-12-15 21:36:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:30,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:30,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72720500] [2023-12-15 21:36:30,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020246286] [2023-12-15 21:36:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020246286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:30,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:30,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:36:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175583735] [2023-12-15 21:36:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:30,319 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:30,561 INFO L93 Difference]: Finished difference Result 329 states and 485 transitions. [2023-12-15 21:36:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:36:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-15 21:36:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:30,563 INFO L225 Difference]: With dead ends: 329 [2023-12-15 21:36:30,563 INFO L226 Difference]: Without dead ends: 214 [2023-12-15 21:36:30,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:36:30,564 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 252 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:30,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 742 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-15 21:36:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 173. [2023-12-15 21:36:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 156 states have (on average 1.4487179487179487) internal successors, (226), 157 states have internal predecessors, (226), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:36:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2023-12-15 21:36:30,572 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 98 [2023-12-15 21:36:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:30,572 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2023-12-15 21:36:30,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2023-12-15 21:36:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 21:36:30,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:30,573 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:30,582 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-15 21:36:30,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:30,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:30,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1303227766, now seen corresponding path program 1 times [2023-12-15 21:36:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396502505] [2023-12-15 21:36:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:30,809 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293892920] [2023-12-15 21:36:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:30,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:30,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:30,811 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-15 21:36:30,832 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-15 21:36:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:31,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:36:31,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:31,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396502505] [2023-12-15 21:36:31,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293892920] [2023-12-15 21:36:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293892920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:36:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031560864] [2023-12-15 21:36:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:31,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:36:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:36:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:36:31,177 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:31,269 INFO L93 Difference]: Finished difference Result 483 states and 712 transitions. [2023-12-15 21:36:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:36:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2023-12-15 21:36:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:31,272 INFO L225 Difference]: With dead ends: 483 [2023-12-15 21:36:31,272 INFO L226 Difference]: Without dead ends: 311 [2023-12-15 21:36:31,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:31,274 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 131 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:31,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 391 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-15 21:36:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 244. [2023-12-15 21:36:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 214 states have (on average 1.4299065420560748) internal successors, (306), 215 states have internal predecessors, (306), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 358 transitions. [2023-12-15 21:36:31,290 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 358 transitions. Word has length 100 [2023-12-15 21:36:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:31,290 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 358 transitions. [2023-12-15 21:36:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 358 transitions. [2023-12-15 21:36:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:36:31,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:31,292 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:31,303 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-15 21:36:31,499 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,SelfDestructingSolverStorable7 [2023-12-15 21:36:31,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:31,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:31,500 INFO L85 PathProgramCache]: Analyzing trace with hash 269264473, now seen corresponding path program 1 times [2023-12-15 21:36:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976070716] [2023-12-15 21:36:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:31,533 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290161406] [2023-12-15 21:36:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:31,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:31,535 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-15 21:36:31,552 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-15 21:36:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:31,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:36:31,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:31,784 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 23 treesize of output 15 [2023-12-15 21:36:31,787 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-15 21:36:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:31,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976070716] [2023-12-15 21:36:31,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290161406] [2023-12-15 21:36:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290161406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848108021] [2023-12-15 21:36:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:31,802 INFO L87 Difference]: Start difference. First operand 244 states and 358 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:31,941 INFO L93 Difference]: Finished difference Result 559 states and 811 transitions. [2023-12-15 21:36:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:31,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-15 21:36:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:31,944 INFO L225 Difference]: With dead ends: 559 [2023-12-15 21:36:31,944 INFO L226 Difference]: Without dead ends: 387 [2023-12-15 21:36:31,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-15 21:36:31,945 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 129 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:31,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 520 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-12-15 21:36:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 266. [2023-12-15 21:36:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 236 states have (on average 1.4194915254237288) internal successors, (335), 237 states have internal predecessors, (335), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 387 transitions. [2023-12-15 21:36:31,958 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 387 transitions. Word has length 101 [2023-12-15 21:36:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:31,959 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 387 transitions. [2023-12-15 21:36:31,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 387 transitions. [2023-12-15 21:36:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 21:36:31,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:31,960 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:31,967 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-15 21:36:32,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:32,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:32,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -123762537, now seen corresponding path program 1 times [2023-12-15 21:36:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864087375] [2023-12-15 21:36:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:32,209 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:32,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36558026] [2023-12-15 21:36:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:32,210 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-15 21:36:32,230 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-15 21:36:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:32,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 21:36:32,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:32,469 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 17 treesize of output 13 [2023-12-15 21:36:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:32,516 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-15 21:36:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 21:36:32,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:36:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:32,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864087375] [2023-12-15 21:36:32,729 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36558026] [2023-12-15 21:36:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36558026] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:36:32,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:36:32,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2023-12-15 21:36:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131459579] [2023-12-15 21:36:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:32,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:32,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:36:32,731 INFO L87 Difference]: Start difference. First operand 266 states and 387 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:33,042 INFO L93 Difference]: Finished difference Result 747 states and 1097 transitions. [2023-12-15 21:36:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:36:33,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-15 21:36:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:33,045 INFO L225 Difference]: With dead ends: 747 [2023-12-15 21:36:33,045 INFO L226 Difference]: Without dead ends: 557 [2023-12-15 21:36:33,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:36:33,046 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 331 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:33,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 975 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-12-15 21:36:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 334. [2023-12-15 21:36:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 304 states have (on average 1.4407894736842106) internal successors, (438), 305 states have internal predecessors, (438), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 490 transitions. [2023-12-15 21:36:33,061 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 490 transitions. Word has length 101 [2023-12-15 21:36:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:33,061 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 490 transitions. [2023-12-15 21:36:33,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 490 transitions. [2023-12-15 21:36:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 21:36:33,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:33,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:33,072 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-15 21:36:33,269 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,SelfDestructingSolverStorable9 [2023-12-15 21:36:33,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:33,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -865204483, now seen corresponding path program 1 times [2023-12-15 21:36:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979896678] [2023-12-15 21:36:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:33,297 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381172429] [2023-12-15 21:36:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:33,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:33,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:33,298 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-15 21:36:33,318 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-15 21:36:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:33,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:36:33,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:33,560 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 23 treesize of output 15 [2023-12-15 21:36:33,563 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-15 21:36:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:33,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979896678] [2023-12-15 21:36:33,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:33,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381172429] [2023-12-15 21:36:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381172429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603916772] [2023-12-15 21:36:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:33,580 INFO L87 Difference]: Start difference. First operand 334 states and 490 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:33,694 INFO L93 Difference]: Finished difference Result 644 states and 941 transitions. [2023-12-15 21:36:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-15 21:36:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:33,697 INFO L225 Difference]: With dead ends: 644 [2023-12-15 21:36:33,697 INFO L226 Difference]: Without dead ends: 415 [2023-12-15 21:36:33,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-15 21:36:33,698 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 103 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:33,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 522 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-15 21:36:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 337. [2023-12-15 21:36:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 307 states have (on average 1.4397394136807817) internal successors, (442), 308 states have internal predecessors, (442), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 494 transitions. [2023-12-15 21:36:33,711 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 494 transitions. Word has length 103 [2023-12-15 21:36:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:33,711 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 494 transitions. [2023-12-15 21:36:33,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 494 transitions. [2023-12-15 21:36:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 21:36:33,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:33,713 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:33,722 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-15 21:36:33,919 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,SelfDestructingSolverStorable10 [2023-12-15 21:36:33,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:33,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1258231493, now seen corresponding path program 1 times [2023-12-15 21:36:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510851209] [2023-12-15 21:36:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:33,957 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744409940] [2023-12-15 21:36:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:33,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:33,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:33,958 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-15 21:36:33,980 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-15 21:36:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:34,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-15 21:36:34,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:34,237 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 17 [2023-12-15 21:36:34,252 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 23 treesize of output 15 [2023-12-15 21:36:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:34,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510851209] [2023-12-15 21:36:34,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744409940] [2023-12-15 21:36:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744409940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042906881] [2023-12-15 21:36:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:34,273 INFO L87 Difference]: Start difference. First operand 337 states and 494 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:34,433 INFO L93 Difference]: Finished difference Result 817 states and 1202 transitions. [2023-12-15 21:36:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-15 21:36:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:34,436 INFO L225 Difference]: With dead ends: 817 [2023-12-15 21:36:34,436 INFO L226 Difference]: Without dead ends: 585 [2023-12-15 21:36:34,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:34,437 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 257 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:34,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 704 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-15 21:36:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 404. [2023-12-15 21:36:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 374 states have (on average 1.4518716577540107) internal successors, (543), 375 states have internal predecessors, (543), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 595 transitions. [2023-12-15 21:36:34,451 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 595 transitions. Word has length 103 [2023-12-15 21:36:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:34,452 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 595 transitions. [2023-12-15 21:36:34,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 595 transitions. [2023-12-15 21:36:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 21:36:34,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:34,453 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:34,463 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-15 21:36:34,660 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,SelfDestructingSolverStorable11 [2023-12-15 21:36:34,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:34,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1614384285, now seen corresponding path program 1 times [2023-12-15 21:36:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79191787] [2023-12-15 21:36:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:34,694 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824846287] [2023-12-15 21:36:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:34,695 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-15 21:36:34,715 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-15 21:36:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:34,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:36:34,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:34,969 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 17 [2023-12-15 21:36:34,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:34,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79191787] [2023-12-15 21:36:34,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824846287] [2023-12-15 21:36:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824846287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344667258] [2023-12-15 21:36:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:34,985 INFO L87 Difference]: Start difference. First operand 404 states and 595 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:35,124 INFO L93 Difference]: Finished difference Result 819 states and 1201 transitions. [2023-12-15 21:36:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:35,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-15 21:36:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:35,127 INFO L225 Difference]: With dead ends: 819 [2023-12-15 21:36:35,127 INFO L226 Difference]: Without dead ends: 546 [2023-12-15 21:36:35,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 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-15 21:36:35,128 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 82 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:35,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 643 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-12-15 21:36:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2023-12-15 21:36:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 422 states have (on average 1.45260663507109) internal successors, (613), 423 states have internal predecessors, (613), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 665 transitions. [2023-12-15 21:36:35,142 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 665 transitions. Word has length 103 [2023-12-15 21:36:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:35,142 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 665 transitions. [2023-12-15 21:36:35,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 665 transitions. [2023-12-15 21:36:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 21:36:35,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:35,144 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:35,153 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-15 21:36:35,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 21:36:35,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:35,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 796735835, now seen corresponding path program 1 times [2023-12-15 21:36:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999514181] [2023-12-15 21:36:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:35,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:35,371 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647750029] [2023-12-15 21:36:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:35,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:35,372 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-15 21:36:35,376 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-15 21:36:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:35,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:36:35,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:35,664 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 23 treesize of output 15 [2023-12-15 21:36:35,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:35,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999514181] [2023-12-15 21:36:35,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647750029] [2023-12-15 21:36:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647750029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:35,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940355165] [2023-12-15 21:36:35,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:35,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:35,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:35,688 INFO L87 Difference]: Start difference. First operand 453 states and 665 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:35,859 INFO L93 Difference]: Finished difference Result 1100 states and 1627 transitions. [2023-12-15 21:36:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-15 21:36:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:35,863 INFO L225 Difference]: With dead ends: 1100 [2023-12-15 21:36:35,863 INFO L226 Difference]: Without dead ends: 807 [2023-12-15 21:36:35,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:35,864 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 197 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:35,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 976 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2023-12-15 21:36:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 567. [2023-12-15 21:36:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 536 states have (on average 1.4570895522388059) internal successors, (781), 537 states have internal predecessors, (781), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 833 transitions. [2023-12-15 21:36:35,886 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 833 transitions. Word has length 103 [2023-12-15 21:36:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:35,889 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 833 transitions. [2023-12-15 21:36:35,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 833 transitions. [2023-12-15 21:36:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 21:36:35,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:35,890 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:35,902 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-15 21:36:36,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:36,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:36,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1477086211, now seen corresponding path program 1 times [2023-12-15 21:36:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123198403] [2023-12-15 21:36:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:36,119 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939329751] [2023-12-15 21:36:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:36,120 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-15 21:36:36,130 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-15 21:36:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:36,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 21:36:36,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:36,409 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 17 [2023-12-15 21:36:36,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:36,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123198403] [2023-12-15 21:36:36,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939329751] [2023-12-15 21:36:36,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939329751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:36,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573009956] [2023-12-15 21:36:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:36,423 INFO L87 Difference]: Start difference. First operand 567 states and 833 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:36,559 INFO L93 Difference]: Finished difference Result 1004 states and 1475 transitions. [2023-12-15 21:36:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-15 21:36:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:36,562 INFO L225 Difference]: With dead ends: 1004 [2023-12-15 21:36:36,562 INFO L226 Difference]: Without dead ends: 641 [2023-12-15 21:36:36,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 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-15 21:36:36,563 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 89 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:36,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 642 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-15 21:36:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 501. [2023-12-15 21:36:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 470 states have (on average 1.446808510638298) internal successors, (680), 471 states have internal predecessors, (680), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 732 transitions. [2023-12-15 21:36:36,577 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 732 transitions. Word has length 103 [2023-12-15 21:36:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:36,578 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 732 transitions. [2023-12-15 21:36:36,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 732 transitions. [2023-12-15 21:36:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:36,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:36,579 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:36,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-15 21:36:36,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-15 21:36:36,786 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:36,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1444648301, now seen corresponding path program 1 times [2023-12-15 21:36:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:36,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533459335] [2023-12-15 21:36:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:36,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:36,837 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761919567] [2023-12-15 21:36:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:36,838 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-15 21:36:36,863 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-15 21:36:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:37,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:36:37,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:37,131 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 33 treesize of output 25 [2023-12-15 21:36:37,210 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 42 treesize of output 30 [2023-12-15 21:36:37,233 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 39 treesize of output 31 [2023-12-15 21:36:37,246 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 23 treesize of output 15 [2023-12-15 21:36:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:37,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533459335] [2023-12-15 21:36:37,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761919567] [2023-12-15 21:36:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761919567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241408192] [2023-12-15 21:36:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:37,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:37,267 INFO L87 Difference]: Start difference. First operand 501 states and 732 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:37,555 INFO L93 Difference]: Finished difference Result 971 states and 1423 transitions. [2023-12-15 21:36:37,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:37,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:37,558 INFO L225 Difference]: With dead ends: 971 [2023-12-15 21:36:37,559 INFO L226 Difference]: Without dead ends: 653 [2023-12-15 21:36:37,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:36:37,560 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 249 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:37,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 712 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-12-15 21:36:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 500. [2023-12-15 21:36:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 469 states have (on average 1.4456289978678039) internal successors, (678), 470 states have internal predecessors, (678), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 730 transitions. [2023-12-15 21:36:37,573 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 730 transitions. Word has length 104 [2023-12-15 21:36:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:37,574 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 730 transitions. [2023-12-15 21:36:37,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 730 transitions. [2023-12-15 21:36:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:37,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:37,575 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:37,585 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-15 21:36:37,776 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,SelfDestructingSolverStorable15 [2023-12-15 21:36:37,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:37,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2078568385, now seen corresponding path program 1 times [2023-12-15 21:36:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033615253] [2023-12-15 21:36:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:37,797 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:37,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467495163] [2023-12-15 21:36:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:37,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:37,799 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-15 21:36:37,817 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-15 21:36:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:38,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 21:36:38,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:38,071 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 23 treesize of output 15 [2023-12-15 21:36:38,124 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 32 treesize of output 24 [2023-12-15 21:36:38,141 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 38 treesize of output 30 [2023-12-15 21:36:38,147 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 17 [2023-12-15 21:36:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:38,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033615253] [2023-12-15 21:36:38,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467495163] [2023-12-15 21:36:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467495163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:38,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:36:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749377006] [2023-12-15 21:36:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:38,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:38,163 INFO L87 Difference]: Start difference. First operand 500 states and 730 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:38,430 INFO L93 Difference]: Finished difference Result 938 states and 1375 transitions. [2023-12-15 21:36:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:38,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:38,433 INFO L225 Difference]: With dead ends: 938 [2023-12-15 21:36:38,433 INFO L226 Difference]: Without dead ends: 621 [2023-12-15 21:36:38,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:36:38,434 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 274 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:38,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 935 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-12-15 21:36:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 511. [2023-12-15 21:36:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 480 states have (on average 1.4479166666666667) internal successors, (695), 481 states have internal predecessors, (695), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 747 transitions. [2023-12-15 21:36:38,449 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 747 transitions. Word has length 104 [2023-12-15 21:36:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:38,449 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 747 transitions. [2023-12-15 21:36:38,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 747 transitions. [2023-12-15 21:36:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:38,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:38,450 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:38,460 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-15 21:36:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-15 21:36:38,657 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:38,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1793697085, now seen corresponding path program 1 times [2023-12-15 21:36:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132511487] [2023-12-15 21:36:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:38,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967157144] [2023-12-15 21:36:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:38,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:38,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:38,680 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-15 21:36:38,701 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-15 21:36:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:38,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:36:38,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:38,985 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 23 treesize of output 15 [2023-12-15 21:36:38,990 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-15 21:36:39,017 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 55 treesize of output 43 [2023-12-15 21:36:39,023 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 34 treesize of output 22 [2023-12-15 21:36:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:39,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132511487] [2023-12-15 21:36:39,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967157144] [2023-12-15 21:36:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967157144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:39,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:39,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:39,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227777789] [2023-12-15 21:36:39,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:39,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:39,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:39,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:39,042 INFO L87 Difference]: Start difference. First operand 511 states and 747 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:39,265 INFO L93 Difference]: Finished difference Result 1017 states and 1493 transitions. [2023-12-15 21:36:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:39,268 INFO L225 Difference]: With dead ends: 1017 [2023-12-15 21:36:39,268 INFO L226 Difference]: Without dead ends: 694 [2023-12-15 21:36:39,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:39,269 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 195 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:39,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 860 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2023-12-15 21:36:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 499. [2023-12-15 21:36:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 468 states have (on average 1.4444444444444444) internal successors, (676), 469 states have internal predecessors, (676), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 728 transitions. [2023-12-15 21:36:39,283 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 728 transitions. Word has length 104 [2023-12-15 21:36:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:39,283 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 728 transitions. [2023-12-15 21:36:39,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 728 transitions. [2023-12-15 21:36:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:39,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:39,284 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:39,292 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-15 21:36:39,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-15 21:36:39,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:39,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -786715223, now seen corresponding path program 1 times [2023-12-15 21:36:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491239740] [2023-12-15 21:36:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:39,511 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380540678] [2023-12-15 21:36:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:39,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:39,513 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-15 21:36:39,519 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-15 21:36:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:39,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-15 21:36:39,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:39,817 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 33 treesize of output 25 [2023-12-15 21:36:39,856 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 33 treesize of output 25 [2023-12-15 21:36:39,860 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 46 treesize of output 34 [2023-12-15 21:36:39,864 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 38 treesize of output 26 [2023-12-15 21:36:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:39,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491239740] [2023-12-15 21:36:39,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:39,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380540678] [2023-12-15 21:36:39,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380540678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:39,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:39,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:36:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189278665] [2023-12-15 21:36:39,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:39,879 INFO L87 Difference]: Start difference. First operand 499 states and 728 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:40,200 INFO L93 Difference]: Finished difference Result 952 states and 1388 transitions. [2023-12-15 21:36:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:40,203 INFO L225 Difference]: With dead ends: 952 [2023-12-15 21:36:40,203 INFO L226 Difference]: Without dead ends: 636 [2023-12-15 21:36:40,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:36:40,204 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 242 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:40,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1001 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:36:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-15 21:36:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 499. [2023-12-15 21:36:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 468 states have (on average 1.4444444444444444) internal successors, (676), 469 states have internal predecessors, (676), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 728 transitions. [2023-12-15 21:36:40,221 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 728 transitions. Word has length 104 [2023-12-15 21:36:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:40,221 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 728 transitions. [2023-12-15 21:36:40,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 728 transitions. [2023-12-15 21:36:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:40,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:40,222 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:40,235 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-15 21:36:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:40,429 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:40,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1179742233, now seen corresponding path program 1 times [2023-12-15 21:36:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14052453] [2023-12-15 21:36:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:40,457 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516657834] [2023-12-15 21:36:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:40,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:40,459 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-15 21:36:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:40,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:36:40,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:40,767 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 42 treesize of output 34 [2023-12-15 21:36:40,779 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 29 treesize of output 21 [2023-12-15 21:36:40,834 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 17 [2023-12-15 21:36:40,849 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 23 treesize of output 15 [2023-12-15 21:36:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:40,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14052453] [2023-12-15 21:36:40,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516657834] [2023-12-15 21:36:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516657834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17149693] [2023-12-15 21:36:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:40,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:40,869 INFO L87 Difference]: Start difference. First operand 499 states and 728 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:41,143 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2023-12-15 21:36:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:41,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:41,146 INFO L225 Difference]: With dead ends: 916 [2023-12-15 21:36:41,146 INFO L226 Difference]: Without dead ends: 600 [2023-12-15 21:36:41,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:36:41,147 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 175 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:41,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1043 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-12-15 21:36:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 486. [2023-12-15 21:36:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 455 states have (on average 1.4395604395604396) internal successors, (655), 456 states have internal predecessors, (655), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 707 transitions. [2023-12-15 21:36:41,163 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 707 transitions. Word has length 104 [2023-12-15 21:36:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:41,163 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 707 transitions. [2023-12-15 21:36:41,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 707 transitions. [2023-12-15 21:36:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:41,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:41,165 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:41,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:41,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:41,370 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:41,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -410960577, now seen corresponding path program 1 times [2023-12-15 21:36:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150888950] [2023-12-15 21:36:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:41,394 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156289979] [2023-12-15 21:36:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:41,396 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:41,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-15 21:36:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-15 21:36:41,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:41,732 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 31 treesize of output 23 [2023-12-15 21:36:41,753 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 37 treesize of output 29 [2023-12-15 21:36:41,765 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 23 treesize of output 15 [2023-12-15 21:36:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:41,779 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:41,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150888950] [2023-12-15 21:36:41,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156289979] [2023-12-15 21:36:41,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156289979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:41,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751497718] [2023-12-15 21:36:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:41,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:41,781 INFO L87 Difference]: Start difference. First operand 486 states and 707 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:42,030 INFO L93 Difference]: Finished difference Result 946 states and 1383 transitions. [2023-12-15 21:36:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:42,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:42,032 INFO L225 Difference]: With dead ends: 946 [2023-12-15 21:36:42,033 INFO L226 Difference]: Without dead ends: 638 [2023-12-15 21:36:42,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:42,034 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 190 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:42,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1134 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:36:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-12-15 21:36:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 486. [2023-12-15 21:36:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 455 states have (on average 1.4395604395604396) internal successors, (655), 456 states have internal predecessors, (655), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 707 transitions. [2023-12-15 21:36:42,046 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 707 transitions. Word has length 104 [2023-12-15 21:36:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:42,046 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 707 transitions. [2023-12-15 21:36:42,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 707 transitions. [2023-12-15 21:36:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:42,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:42,048 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:42,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:42,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:42,255 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:42,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -803987587, now seen corresponding path program 1 times [2023-12-15 21:36:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836387058] [2023-12-15 21:36:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:42,278 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904432635] [2023-12-15 21:36:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:42,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:42,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:42,280 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:42,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-15 21:36:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:42,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-15 21:36:42,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:42,584 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 32 treesize of output 24 [2023-12-15 21:36:42,587 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 28 treesize of output 20 [2023-12-15 21:36:42,589 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 24 treesize of output 16 [2023-12-15 21:36:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:42,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836387058] [2023-12-15 21:36:42,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904432635] [2023-12-15 21:36:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904432635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467688353] [2023-12-15 21:36:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:42,600 INFO L87 Difference]: Start difference. First operand 486 states and 707 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:42,774 INFO L93 Difference]: Finished difference Result 1016 states and 1475 transitions. [2023-12-15 21:36:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:36:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:42,778 INFO L225 Difference]: With dead ends: 1016 [2023-12-15 21:36:42,778 INFO L226 Difference]: Without dead ends: 708 [2023-12-15 21:36:42,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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-15 21:36:42,779 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 154 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:42,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 710 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:36:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-12-15 21:36:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 497. [2023-12-15 21:36:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 466 states have (on average 1.4377682403433476) internal successors, (670), 467 states have internal predecessors, (670), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 722 transitions. [2023-12-15 21:36:42,791 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 722 transitions. Word has length 104 [2023-12-15 21:36:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:42,791 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 722 transitions. [2023-12-15 21:36:42,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 722 transitions. [2023-12-15 21:36:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 21:36:42,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:42,793 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:42,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:43,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:43,001 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:43,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -381285761, now seen corresponding path program 1 times [2023-12-15 21:36:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143260039] [2023-12-15 21:36:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:43,022 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:43,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435291065] [2023-12-15 21:36:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:43,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:43,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:43,024 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:43,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-15 21:36:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 21:36:43,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:43,360 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 31 treesize of output 23 [2023-12-15 21:36:43,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-15 21:36:43,407 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 23 treesize of output 15 [2023-12-15 21:36:43,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:43,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:36:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143260039] [2023-12-15 21:36:43,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435291065] [2023-12-15 21:36:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435291065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:36:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951124496] [2023-12-15 21:36:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:43,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:36:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:36:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:36:43,437 INFO L87 Difference]: Start difference. First operand 497 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:43,860 INFO L93 Difference]: Finished difference Result 935 states and 1361 transitions. [2023-12-15 21:36:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:36:43,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-15 21:36:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:43,862 INFO L225 Difference]: With dead ends: 935 [2023-12-15 21:36:43,863 INFO L226 Difference]: Without dead ends: 621 [2023-12-15 21:36:43,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:36:43,864 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 188 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:43,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1338 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:36:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-12-15 21:36:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 484. [2023-12-15 21:36:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 453 states have (on average 1.4326710816777042) internal successors, (649), 454 states have internal predecessors, (649), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:36:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 701 transitions. [2023-12-15 21:36:43,877 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 701 transitions. Word has length 104 [2023-12-15 21:36:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:43,877 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 701 transitions. [2023-12-15 21:36:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 701 transitions. [2023-12-15 21:36:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:36:43,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:43,878 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:43,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:44,086 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:44,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1422558977, now seen corresponding path program 1 times [2023-12-15 21:36:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844524751] [2023-12-15 21:36:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:44,115 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698171060] [2023-12-15 21:36:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:44,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:44,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:44,117 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:44,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-15 21:36:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-15 21:36:44,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:44,406 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 17 treesize of output 13 [2023-12-15 21:36:44,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:36:44,451 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-15 21:36:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 21:36:44,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:36:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:36:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844524751] [2023-12-15 21:36:44,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 21:36:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698171060] [2023-12-15 21:36:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698171060] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:36:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:36:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2023-12-15 21:36:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457355874] [2023-12-15 21:36:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:44,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:36:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:44,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:36:44,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:36:44,668 INFO L87 Difference]: Start difference. First operand 484 states and 701 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:45,160 INFO L93 Difference]: Finished difference Result 1045 states and 1513 transitions. [2023-12-15 21:36:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:36:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-15 21:36:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:45,163 INFO L225 Difference]: With dead ends: 1045 [2023-12-15 21:36:45,163 INFO L226 Difference]: Without dead ends: 739 [2023-12-15 21:36:45,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:36:45,164 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 351 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:45,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1842 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:36:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-12-15 21:36:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 583. [2023-12-15 21:36:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 542 states have (on average 1.4169741697416973) internal successors, (768), 545 states have internal predecessors, (768), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:36:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 836 transitions. [2023-12-15 21:36:45,180 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 836 transitions. Word has length 105 [2023-12-15 21:36:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:45,180 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 836 transitions. [2023-12-15 21:36:45,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:36:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 836 transitions. [2023-12-15 21:36:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 21:36:45,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:45,182 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:45,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:45,389 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1538221119, now seen corresponding path program 1 times [2023-12-15 21:36:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151042434] [2023-12-15 21:36:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:45,408 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 21:36:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135714224] [2023-12-15 21:36:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:45,410 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:36:45,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-15 21:36:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:36:45,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:36:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:36:46,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:36:46,008 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:36:46,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:36:46,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-15 21:36:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-15 21:36:46,222 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-15 21:36:46,224 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:36:46,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:36:46 BoogieIcfgContainer [2023-12-15 21:36:46,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:36:46,346 INFO L158 Benchmark]: Toolchain (without parser) took 21492.37ms. Allocated memory was 308.3MB in the beginning and 449.8MB in the end (delta: 141.6MB). Free memory was 254.8MB in the beginning and 402.2MB in the end (delta: -147.4MB). Peak memory consumption was 244.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,346 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 185.6MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:36:46,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.34ms. Allocated memory is still 308.3MB. Free memory was 254.3MB in the beginning and 239.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.71ms. Allocated memory is still 308.3MB. Free memory was 239.6MB in the beginning and 235.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,346 INFO L158 Benchmark]: Boogie Preprocessor took 81.07ms. Allocated memory is still 308.3MB. Free memory was 235.4MB in the beginning and 230.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,347 INFO L158 Benchmark]: RCFGBuilder took 764.26ms. Allocated memory is still 308.3MB. Free memory was 230.1MB in the beginning and 188.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,347 INFO L158 Benchmark]: TraceAbstraction took 20275.70ms. Allocated memory was 308.3MB in the beginning and 449.8MB in the end (delta: 141.6MB). Free memory was 187.7MB in the beginning and 402.2MB in the end (delta: -214.5MB). Peak memory consumption was 177.1MB. Max. memory is 8.0GB. [2023-12-15 21:36:46,348 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.16ms. Allocated memory is still 185.6MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.34ms. Allocated memory is still 308.3MB. Free memory was 254.3MB in the beginning and 239.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.71ms. Allocated memory is still 308.3MB. Free memory was 239.6MB in the beginning and 235.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.07ms. Allocated memory is still 308.3MB. Free memory was 235.4MB in the beginning and 230.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 764.26ms. Allocated memory is still 308.3MB. Free memory was 230.1MB in the beginning and 188.2MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 20275.70ms. Allocated memory was 308.3MB in the beginning and 449.8MB in the end (delta: 141.6MB). Free memory was 187.7MB in the beginning and 402.2MB in the end (delta: -214.5MB). Peak memory consumption was 177.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_5 = 200; [L25] unsigned short int* var_1_5_Pointer = &(var_1_5); [L26] unsigned short int var_1_6 = 56955; [L26] unsigned short int var_1_6 = 56955; [L27] unsigned short int* var_1_6_Pointer = &(var_1_6); [L28] unsigned short int var_1_7 = 32; [L28] unsigned short int var_1_7 = 32; [L29] unsigned short int* var_1_7_Pointer = &(var_1_7); [L30] unsigned short int var_1_8 = 1; [L30] unsigned short int var_1_8 = 1; [L31] unsigned short int* var_1_8_Pointer = &(var_1_8); [L32] unsigned short int var_1_9 = 8; [L32] unsigned short int var_1_9 = 8; [L33] unsigned short int* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 1; [L34] unsigned char var_1_10 = 1; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] float var_1_11 = -0.6; [L36] float var_1_11 = -0.6; [L37] float* var_1_11_Pointer = &(var_1_11); [L38] float var_1_12 = 9.125; [L38] float var_1_12 = 9.125; [L39] float* var_1_12_Pointer = &(var_1_12); [L40] float var_1_13 = 50.5; [L40] float var_1_13 = 50.5; [L41] float* var_1_13_Pointer = &(var_1_13); [L42] unsigned short int last_1_var_1_1 = 10; [L43] unsigned short int last_1_var_1_9 = 8; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_1) [L95] last_1_var_1_1 = var_1_1 [L96] EXPR \read(var_1_9) [L96] last_1_var_1_9 = var_1_9 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] var_1_7 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] var_1_8 = __VERIFIER_nondet_ushort() [L84] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_12 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_13 = __VERIFIER_nondet_float() [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET updateVariables() [L108] CALL step() [L47] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR \read(*var_1_6_Pointer) [L48] EXPR \read(*var_1_7_Pointer) [L48] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L48] EXPR \read(*var_1_8_Pointer) [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] (*(var_1_1_Pointer)) = (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))) [L50] EXPR \read(*var_1_10_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L50] EXPR \read(*var_1_6_Pointer) [L50] EXPR \read(*var_1_8_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_9_Pointer)) = (*(var_1_6_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L63] COND FALSE !((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) [L70] EXPR \read(*var_1_12_Pointer) [L70] (*(var_1_11_Pointer)) = (*(var_1_12_Pointer)) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) [L99] EXPR \read(*var_1_10_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) [L99] EXPR \read(*var_1_9_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_12_Pointer) [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99-L100] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 25, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3751 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3750 mSDsluCounter, 17425 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13307 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3632 IncrementalHoareTripleChecker+Invalid, 3687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 4118 mSDtfsCounter, 3632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2676 GetRequests, 2500 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=583occurred in iteration=24, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 2608 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 6432 SizeOfPredicates, 269 NumberOfNonLiveVariables, 11132 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 6798/6864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 21:36:46,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...