/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:49:19,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:49:19,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:49:19,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:49:19,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:49:19,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:49:19,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:49:19,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:49:19,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:49:19,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:49:19,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:49:19,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:49:19,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:49:19,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:49:19,308 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:49:19,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:49:19,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:49:19,308 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:49:19,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:49:19,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:49:19,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:49:19,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:49:19,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:49:19,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:49:19,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:49:19,310 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:49:19,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:49:19,310 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:49:19,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:49:19,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:49:19,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:49:19,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:49:19,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:49:19,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:49:19,312 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:49:19,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:49:19,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:49:19,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:49:19,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:49:19,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:49:19,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:49:19,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:49:19,537 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:49:19,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-12-16 04:49:20,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:49:20,761 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:49:20,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2023-12-16 04:49:20,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dacfc3e1/eaa25e66ebee44c38ffad0cf65f28eee/FLAG9e5f3ae3c [2023-12-16 04:49:20,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dacfc3e1/eaa25e66ebee44c38ffad0cf65f28eee [2023-12-16 04:49:20,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:49:20,796 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:49:20,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:49:20,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:49:20,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:49:20,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:49:20" (1/1) ... [2023-12-16 04:49:20,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797662ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:20, skipping insertion in model container [2023-12-16 04:49:20,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:49:20" (1/1) ... [2023-12-16 04:49:20,829 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:49:20,946 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-12-16 04:49:20,951 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-12-16 04:49:20,953 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-12-16 04:49:20,954 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-12-16 04:49:20,956 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-12-16 04:49:20,957 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-12-16 04:49:20,958 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-12-16 04:49:20,959 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-12-16 04:49:20,960 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-12-16 04:49:20,961 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-12-16 04:49:20,963 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-12-16 04:49:20,964 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-12-16 04:49:20,966 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-12-16 04:49:20,967 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-12-16 04:49:20,970 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-12-16 04:49:20,971 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-12-16 04:49:20,972 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-12-16 04:49:20,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:49:20,983 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:49:20,995 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2023-12-16 04:49:20,996 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2023-12-16 04:49:20,997 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2023-12-16 04:49:20,998 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2023-12-16 04:49:20,999 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2023-12-16 04:49:21,000 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2023-12-16 04:49:21,001 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2023-12-16 04:49:21,003 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2023-12-16 04:49:21,004 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2023-12-16 04:49:21,005 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2023-12-16 04:49:21,007 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2023-12-16 04:49:21,007 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2023-12-16 04:49:21,009 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2023-12-16 04:49:21,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2023-12-16 04:49:21,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2023-12-16 04:49:21,011 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2023-12-16 04:49:21,012 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2023-12-16 04:49:21,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:49:21,025 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:49:21,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21 WrapperNode [2023-12-16 04:49:21,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:49:21,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:49:21,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:49:21,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:49:21,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,061 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 261 [2023-12-16 04:49:21,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:49:21,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:49:21,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:49:21,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:49:21,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 04:49:21,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:49:21,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:49:21,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:49:21,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:49:21,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (1/1) ... [2023-12-16 04:49:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:49:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:49:21,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:49:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:49:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:49:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:49:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:49:21,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:49:21,246 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:49:21,248 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:49:21,458 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:49:21,478 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:49:21,478 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 04:49:21,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:49:21 BoogieIcfgContainer [2023-12-16 04:49:21,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:49:21,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:49:21,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:49:21,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:49:21,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:49:20" (1/3) ... [2023-12-16 04:49:21,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430a4ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:49:21, skipping insertion in model container [2023-12-16 04:49:21,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:49:21" (2/3) ... [2023-12-16 04:49:21,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430a4ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:49:21, skipping insertion in model container [2023-12-16 04:49:21,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:49:21" (3/3) ... [2023-12-16 04:49:21,485 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2023-12-16 04:49:21,497 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:49:21,497 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-12-16 04:49:21,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:49:21,543 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;@64f3c533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:49:21,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-12-16 04:49:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 68 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 04:49:21,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:21,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:21,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:21,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1273763384, now seen corresponding path program 1 times [2023-12-16 04:49:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502778718] [2023-12-16 04:49:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502778718] [2023-12-16 04:49:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502778718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:21,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:21,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385089323] [2023-12-16 04:49:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:21,842 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 68 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:21,968 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2023-12-16 04:49:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 04:49:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:21,975 INFO L225 Difference]: With dead ends: 118 [2023-12-16 04:49:21,975 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 04:49:21,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:21,979 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 79 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:21,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 234 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 04:49:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2023-12-16 04:49:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-12-16 04:49:22,002 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 7 [2023-12-16 04:49:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,002 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-12-16 04:49:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-12-16 04:49:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 04:49:22,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:49:22,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1277398875, now seen corresponding path program 1 times [2023-12-16 04:49:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016275209] [2023-12-16 04:49:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016275209] [2023-12-16 04:49:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016275209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897545297] [2023-12-16 04:49:22,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:22,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:22,073 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,124 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-12-16 04:49:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:49:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 04:49:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,127 INFO L225 Difference]: With dead ends: 64 [2023-12-16 04:49:22,127 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 04:49:22,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,130 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 04:49:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 04:49:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-12-16 04:49:22,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2023-12-16 04:49:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,137 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-12-16 04:49:22,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-12-16 04:49:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 04:49:22,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:49:22,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -944655405, now seen corresponding path program 1 times [2023-12-16 04:49:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511705686] [2023-12-16 04:49:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511705686] [2023-12-16 04:49:22,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511705686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050245841] [2023-12-16 04:49:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:22,187 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,228 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-12-16 04:49:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-16 04:49:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,228 INFO L225 Difference]: With dead ends: 68 [2023-12-16 04:49:22,229 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 04:49:22,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,230 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 113 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 04:49:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-12-16 04:49:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2023-12-16 04:49:22,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2023-12-16 04:49:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,234 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2023-12-16 04:49:22,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2023-12-16 04:49:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 04:49:22,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:49:22,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash -644922484, now seen corresponding path program 1 times [2023-12-16 04:49:22,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910708009] [2023-12-16 04:49:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910708009] [2023-12-16 04:49:22,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910708009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87056055] [2023-12-16 04:49:22,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:22,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,286 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,348 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-12-16 04:49:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 04:49:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,349 INFO L225 Difference]: With dead ends: 66 [2023-12-16 04:49:22,350 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 04:49:22,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:22,351 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 108 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 04:49:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2023-12-16 04:49:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-12-16 04:49:22,355 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 10 [2023-12-16 04:49:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,355 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-12-16 04:49:22,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-12-16 04:49:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 04:49:22,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:49:22,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1575617705, now seen corresponding path program 1 times [2023-12-16 04:49:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604581077] [2023-12-16 04:49:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604581077] [2023-12-16 04:49:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604581077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774452847] [2023-12-16 04:49:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,399 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,452 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-12-16 04:49:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 04:49:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,453 INFO L225 Difference]: With dead ends: 64 [2023-12-16 04:49:22,453 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 04:49:22,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:22,454 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 04:49:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-12-16 04:49:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-12-16 04:49:22,458 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 10 [2023-12-16 04:49:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,459 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-12-16 04:49:22,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-12-16 04:49:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:49:22,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:49:22,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1482243665, now seen corresponding path program 1 times [2023-12-16 04:49:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069231451] [2023-12-16 04:49:22,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069231451] [2023-12-16 04:49:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069231451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093108492] [2023-12-16 04:49:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:22,497 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,530 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-12-16 04:49:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:49:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 04:49:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,531 INFO L225 Difference]: With dead ends: 62 [2023-12-16 04:49:22,531 INFO L226 Difference]: Without dead ends: 58 [2023-12-16 04:49:22,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,532 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 122 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-16 04:49:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2023-12-16 04:49:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-12-16 04:49:22,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2023-12-16 04:49:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,535 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-12-16 04:49:22,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-12-16 04:49:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:49:22,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:49:22,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1482734223, now seen corresponding path program 1 times [2023-12-16 04:49:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616042835] [2023-12-16 04:49:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616042835] [2023-12-16 04:49:22,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616042835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670364186] [2023-12-16 04:49:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:22,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,576 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,663 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-12-16 04:49:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 04:49:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,664 INFO L225 Difference]: With dead ends: 99 [2023-12-16 04:49:22,664 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 04:49:22,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:22,665 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 95 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 139 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 04:49:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2023-12-16 04:49:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-12-16 04:49:22,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2023-12-16 04:49:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,668 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-12-16 04:49:22,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-12-16 04:49:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:49:22,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:49:22,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1599504525, now seen corresponding path program 1 times [2023-12-16 04:49:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598646279] [2023-12-16 04:49:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598646279] [2023-12-16 04:49:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598646279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32823359] [2023-12-16 04:49:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:22,699 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,727 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-12-16 04:49:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:49:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 04:49:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,729 INFO L225 Difference]: With dead ends: 56 [2023-12-16 04:49:22,729 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 04:49:22,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:22,731 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 04:49:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-12-16 04:49:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-12-16 04:49:22,737 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2023-12-16 04:49:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,738 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-12-16 04:49:22,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-12-16 04:49:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 04:49:22,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:49:22,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1279875133, now seen corresponding path program 1 times [2023-12-16 04:49:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476311214] [2023-12-16 04:49:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476311214] [2023-12-16 04:49:22,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476311214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223024049] [2023-12-16 04:49:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:22,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:22,866 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:22,958 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2023-12-16 04:49:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:49:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 04:49:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:22,959 INFO L225 Difference]: With dead ends: 117 [2023-12-16 04:49:22,959 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:49:22,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:22,961 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 76 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:22,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 244 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:49:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 56. [2023-12-16 04:49:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-12-16 04:49:22,972 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2023-12-16 04:49:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:22,972 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-12-16 04:49:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-12-16 04:49:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 04:49:22,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:22,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:22,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:49:22,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:22,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1972021740, now seen corresponding path program 1 times [2023-12-16 04:49:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847425020] [2023-12-16 04:49:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847425020] [2023-12-16 04:49:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847425020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637651817] [2023-12-16 04:49:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:23,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:23,017 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,068 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-12-16 04:49:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:23,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 04:49:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,069 INFO L225 Difference]: With dead ends: 73 [2023-12-16 04:49:23,069 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 04:49:23,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,069 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 98 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 04:49:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2023-12-16 04:49:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-12-16 04:49:23,072 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2023-12-16 04:49:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,073 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-12-16 04:49:23,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-12-16 04:49:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 04:49:23,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:49:23,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1973745644, now seen corresponding path program 1 times [2023-12-16 04:49:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922501310] [2023-12-16 04:49:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922501310] [2023-12-16 04:49:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922501310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551383374] [2023-12-16 04:49:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:23,112 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,156 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-16 04:49:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:23,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 04:49:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,157 INFO L225 Difference]: With dead ends: 54 [2023-12-16 04:49:23,157 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 04:49:23,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,157 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 72 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 04:49:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-16 04:49:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-16 04:49:23,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 12 [2023-12-16 04:49:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,164 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-16 04:49:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-16 04:49:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 04:49:23,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:49:23,167 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1028222508, now seen corresponding path program 1 times [2023-12-16 04:49:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338368636] [2023-12-16 04:49:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338368636] [2023-12-16 04:49:23,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338368636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768471123] [2023-12-16 04:49:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,273 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,335 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-12-16 04:49:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:49:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 04:49:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,336 INFO L225 Difference]: With dead ends: 77 [2023-12-16 04:49:23,337 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 04:49:23,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:49:23,337 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 80 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 04:49:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-12-16 04:49:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-16 04:49:23,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2023-12-16 04:49:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,339 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-16 04:49:23,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-16 04:49:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 04:49:23,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:49:23,340 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1003135894, now seen corresponding path program 1 times [2023-12-16 04:49:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227313745] [2023-12-16 04:49:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227313745] [2023-12-16 04:49:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227313745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201104865] [2023-12-16 04:49:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:23,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,401 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,471 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-12-16 04:49:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:49:23,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 04:49:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,472 INFO L225 Difference]: With dead ends: 91 [2023-12-16 04:49:23,472 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 04:49:23,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:23,473 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 55 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 126 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 04:49:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2023-12-16 04:49:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-12-16 04:49:23,474 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 13 [2023-12-16 04:49:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,474 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-12-16 04:49:23,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-12-16 04:49:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 04:49:23,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:49:23,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1004683039, now seen corresponding path program 1 times [2023-12-16 04:49:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933313319] [2023-12-16 04:49:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933313319] [2023-12-16 04:49:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933313319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:49:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774544030] [2023-12-16 04:49:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:49:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:49:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:23,503 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,571 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-12-16 04:49:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 04:49:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,572 INFO L225 Difference]: With dead ends: 80 [2023-12-16 04:49:23,572 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 04:49:23,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,573 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 90 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 04:49:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2023-12-16 04:49:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-12-16 04:49:23,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 13 [2023-12-16 04:49:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,576 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-12-16 04:49:23,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-12-16 04:49:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 04:49:23,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:49:23,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1056576974, now seen corresponding path program 1 times [2023-12-16 04:49:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025241482] [2023-12-16 04:49:23,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025241482] [2023-12-16 04:49:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025241482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385095902] [2023-12-16 04:49:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,644 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,708 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-12-16 04:49:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 04:49:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,709 INFO L225 Difference]: With dead ends: 69 [2023-12-16 04:49:23,709 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 04:49:23,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:23,711 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 111 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 04:49:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2023-12-16 04:49:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-12-16 04:49:23,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2023-12-16 04:49:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,713 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-12-16 04:49:23,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-12-16 04:49:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:49:23,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:49:23,714 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1080407270, now seen corresponding path program 1 times [2023-12-16 04:49:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926747640] [2023-12-16 04:49:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926747640] [2023-12-16 04:49:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926747640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898096086] [2023-12-16 04:49:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:23,813 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,884 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-12-16 04:49:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:49:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 04:49:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,885 INFO L225 Difference]: With dead ends: 86 [2023-12-16 04:49:23,885 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 04:49:23,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:49:23,885 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 41 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 04:49:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2023-12-16 04:49:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2023-12-16 04:49:23,888 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 14 [2023-12-16 04:49:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,888 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2023-12-16 04:49:23,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2023-12-16 04:49:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 04:49:23,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:49:23,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1941047225, now seen corresponding path program 1 times [2023-12-16 04:49:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437093380] [2023-12-16 04:49:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437093380] [2023-12-16 04:49:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437093380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263026549] [2023-12-16 04:49:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:23,922 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:23,938 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2023-12-16 04:49:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:49:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 04:49:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:23,939 INFO L225 Difference]: With dead ends: 62 [2023-12-16 04:49:23,939 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 04:49:23,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:23,940 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:23,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 04:49:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-16 04:49:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-12-16 04:49:23,941 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 15 [2023-12-16 04:49:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:23,941 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-12-16 04:49:23,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-12-16 04:49:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 04:49:23,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:23,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:49:23,942 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:23,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 42925946, now seen corresponding path program 1 times [2023-12-16 04:49:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196789536] [2023-12-16 04:49:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:23,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196789536] [2023-12-16 04:49:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196789536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:23,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:23,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:49:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363686904] [2023-12-16 04:49:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:23,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:49:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:49:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:49:23,985 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:24,010 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-12-16 04:49:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:49:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-16 04:49:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:24,010 INFO L225 Difference]: With dead ends: 60 [2023-12-16 04:49:24,011 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 04:49:24,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:49:24,011 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:24,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 04:49:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 04:49:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2023-12-16 04:49:24,012 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2023-12-16 04:49:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:24,013 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2023-12-16 04:49:24,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2023-12-16 04:49:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:49:24,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:24,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:24,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:49:24,014 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:24,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 357602768, now seen corresponding path program 1 times [2023-12-16 04:49:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538169256] [2023-12-16 04:49:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538169256] [2023-12-16 04:49:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538169256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:49:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105297276] [2023-12-16 04:49:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:49:24,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:49:24,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:49:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:49:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:24,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 04:49:24,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:49:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:24,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:49:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 04:49:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105297276] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:49:24,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:49:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2023-12-16 04:49:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122046205] [2023-12-16 04:49:24,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:49:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 04:49:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 04:49:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:49:24,468 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:24,667 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2023-12-16 04:49:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:49:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 04:49:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:24,668 INFO L225 Difference]: With dead ends: 103 [2023-12-16 04:49:24,668 INFO L226 Difference]: Without dead ends: 101 [2023-12-16 04:49:24,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:49:24,670 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 371 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:24,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 154 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:49:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-16 04:49:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 52. [2023-12-16 04:49:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-16 04:49:24,672 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 17 [2023-12-16 04:49:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:24,672 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-16 04:49:24,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-16 04:49:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:49:24,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:24,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:24,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:49:24,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:49:24,877 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:24,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1345823408, now seen corresponding path program 1 times [2023-12-16 04:49:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208575080] [2023-12-16 04:49:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208575080] [2023-12-16 04:49:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208575080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204790986] [2023-12-16 04:49:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:24,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:24,934 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:24,982 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-12-16 04:49:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 04:49:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:24,982 INFO L225 Difference]: With dead ends: 67 [2023-12-16 04:49:24,983 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 04:49:24,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:49:24,983 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:24,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 04:49:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2023-12-16 04:49:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2023-12-16 04:49:24,984 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 17 [2023-12-16 04:49:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2023-12-16 04:49:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2023-12-16 04:49:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:49:24,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:24,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:24,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:49:24,985 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:24,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1490378293, now seen corresponding path program 1 times [2023-12-16 04:49:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830523522] [2023-12-16 04:49:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830523522] [2023-12-16 04:49:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830523522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695859248] [2023-12-16 04:49:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:25,037 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:25,085 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-12-16 04:49:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:49:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 04:49:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:25,086 INFO L225 Difference]: With dead ends: 59 [2023-12-16 04:49:25,086 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 04:49:25,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:49:25,087 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:25,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 32 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 04:49:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2023-12-16 04:49:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-12-16 04:49:25,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2023-12-16 04:49:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:25,088 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-12-16 04:49:25,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-12-16 04:49:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:49:25,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:25,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:25,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:49:25,089 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:25,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1543819373, now seen corresponding path program 1 times [2023-12-16 04:49:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163788216] [2023-12-16 04:49:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163788216] [2023-12-16 04:49:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163788216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:49:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:49:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:49:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085014605] [2023-12-16 04:49:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:49:25,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:49:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:49:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:49:25,139 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:25,174 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-12-16 04:49:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:49:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 04:49:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:25,174 INFO L225 Difference]: With dead ends: 42 [2023-12-16 04:49:25,174 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 04:49:25,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:49:25,175 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:25,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 22 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 04:49:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 04:49:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2023-12-16 04:49:25,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2023-12-16 04:49:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:25,176 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2023-12-16 04:49:25,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2023-12-16 04:49:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:49:25,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:49:25,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:49:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:49:25,177 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2023-12-16 04:49:25,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:49:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1806015129, now seen corresponding path program 1 times [2023-12-16 04:49:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:49:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469706813] [2023-12-16 04:49:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:49:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:49:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469706813] [2023-12-16 04:49:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469706813] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:49:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506474810] [2023-12-16 04:49:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:49:25,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:49:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:49:25,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:49:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:49:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:49:25,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 04:49:25,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:49:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:49:25,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:49:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 04:49:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506474810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:49:25,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:49:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2023-12-16 04:49:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060162256] [2023-12-16 04:49:25,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:49:25,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 04:49:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:49:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 04:49:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:49:25,517 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:49:25,575 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-16 04:49:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:49:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 04:49:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:49:25,575 INFO L225 Difference]: With dead ends: 30 [2023-12-16 04:49:25,576 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:49:25,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:49:25,576 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:49:25,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:49:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:49:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:49:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:49:25,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2023-12-16 04:49:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:49:25,577 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:49:25,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:49:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:49:25,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:49:25,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2023-12-16 04:49:25,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2023-12-16 04:49:25,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2023-12-16 04:49:25,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2023-12-16 04:49:25,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2023-12-16 04:49:25,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:49:25,785 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,SelfDestructingSolverStorable22 [2023-12-16 04:49:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:49:25,789 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2023-12-16 04:49:25,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2023-12-16 04:49:25,789 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2023-12-16 04:49:25,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2023-12-16 04:49:25,789 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 15 375) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L168(lines 102 252) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L285(lines 283 364) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2023-12-16 04:49:25,790 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point $Ultimate##12(lines 64 253) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2023-12-16 04:49:25,791 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L90(lines 32 368) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2023-12-16 04:49:25,792 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2023-12-16 04:49:25,793 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2023-12-16 04:49:25,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2023-12-16 04:49:25,794 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2023-12-16 04:49:25,794 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2023-12-16 04:49:25,794 INFO L899 garLoopResultBuilder]: For program point L35(lines 32 368) no Hoare annotation was computed. [2023-12-16 04:49:25,796 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] [2023-12-16 04:49:25,798 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:49:25,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:49:25 BoogieIcfgContainer [2023-12-16 04:49:25,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:49:25,802 INFO L158 Benchmark]: Toolchain (without parser) took 5005.88ms. Allocated memory was 251.7MB in the beginning and 306.2MB in the end (delta: 54.5MB). Free memory was 197.8MB in the beginning and 241.0MB in the end (delta: -43.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,802 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 148.3MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:49:25,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.47ms. Allocated memory is still 251.7MB. Free memory was 197.5MB in the beginning and 180.0MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 251.7MB. Free memory was 180.0MB in the beginning and 177.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,803 INFO L158 Benchmark]: Boogie Preprocessor took 47.58ms. Allocated memory is still 251.7MB. Free memory was 177.9MB in the beginning and 175.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,803 INFO L158 Benchmark]: RCFGBuilder took 367.98ms. Allocated memory is still 251.7MB. Free memory was 175.8MB in the beginning and 210.0MB in the end (delta: -34.3MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,804 INFO L158 Benchmark]: TraceAbstraction took 4321.34ms. Allocated memory was 251.7MB in the beginning and 306.2MB in the end (delta: 54.5MB). Free memory was 209.5MB in the beginning and 241.0MB in the end (delta: -31.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 04:49:25,811 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.09ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 148.3MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.47ms. Allocated memory is still 251.7MB. Free memory was 197.5MB in the beginning and 180.0MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 251.7MB. Free memory was 180.0MB in the beginning and 177.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.58ms. Allocated memory is still 251.7MB. Free memory was 177.9MB in the beginning and 175.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.98ms. Allocated memory is still 251.7MB. Free memory was 175.8MB in the beginning and 210.0MB in the end (delta: -34.3MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4321.34ms. Allocated memory was 251.7MB in the beginning and 306.2MB in the end (delta: 54.5MB). Free memory was 209.5MB in the beginning and 241.0MB in the end (delta: -31.5MB). Peak memory consumption was 24.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 - PositiveResult [Line: 44]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 56]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 73]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 115]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 127]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 143]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 155]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 189]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 225]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 237]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 279]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 298]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 310]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 339]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 351]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1549 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1549 mSDsluCounter, 2351 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1449 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1867 IncrementalHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 902 mSDtfsCounter, 1867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 12 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-16 04:49:25,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...