/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:23:23,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:23:23,860 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:23:23,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:23:23,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:23:23,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:23:23,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:23:23,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:23:23,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:23:23,889 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:23:23,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:23:23,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:23:23,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:23:23,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:23:23,892 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:23:23,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:23:23,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:23:23,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:23:23,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:23:23,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:23:23,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:23:23,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:23:23,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:23:23,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:23:23,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:23:23,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:23:23,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:23:23,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:23:23,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:23:23,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:23:23,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:23:23,897 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:23:24,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:23:24,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:23:24,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:23:24,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:23:24,096 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:23:24,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-16 04:23:25,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:23:25,414 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:23:25,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-16 04:23:25,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c1331db/6e91e670dff34c559928d40fbd143342/FLAG117abd5a0 [2023-12-16 04:23:25,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c1331db/6e91e670dff34c559928d40fbd143342 [2023-12-16 04:23:25,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:23:25,443 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:23:25,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:23:25,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:23:25,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:23:25,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ccb1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25, skipping insertion in model container [2023-12-16 04:23:25,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:23:25,600 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-12-16 04:23:25,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:23:25,641 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:23:25,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-12-16 04:23:25,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:23:25,682 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:23:25,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25 WrapperNode [2023-12-16 04:23:25,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:23:25,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:23:25,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:23:25,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:23:25,688 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:23:25" (1/1) ... [2023-12-16 04:23:25,696 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:23:25" (1/1) ... [2023-12-16 04:23:25,722 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2023-12-16 04:23:25,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:23:25,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:23:25,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:23:25,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:23:25,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,760 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2023-12-16 04:23:25,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:23:25,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:23:25,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:23:25,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:23:25,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (1/1) ... [2023-12-16 04:23:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:23:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:23:25,832 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:23:25,838 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:23:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:23:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:23:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:23:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:23:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:23:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:23:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:23:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:23:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:23:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:23:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:23:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:23:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:23:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:23:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:23:25,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:23:26,002 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:23:26,004 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:23:26,333 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:23:26,404 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:23:26,405 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:23:26,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:23:26 BoogieIcfgContainer [2023-12-16 04:23:26,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:23:26,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:23:26,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:23:26,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:23:26,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:23:25" (1/3) ... [2023-12-16 04:23:26,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa97241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:23:26, skipping insertion in model container [2023-12-16 04:23:26,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:25" (2/3) ... [2023-12-16 04:23:26,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa97241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:23:26, skipping insertion in model container [2023-12-16 04:23:26,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:23:26" (3/3) ... [2023-12-16 04:23:26,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-76.i [2023-12-16 04:23:26,421 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:23:26,421 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:23:26,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:23:26,454 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;@607c411c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:23:26,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:23:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:23:26,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:26,469 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:26,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:26,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1477510055, now seen corresponding path program 1 times [2023-12-16 04:23:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645913319] [2023-12-16 04:23:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645913319] [2023-12-16 04:23:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645913319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:23:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014585722] [2023-12-16 04:23:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:23:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:26,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:23:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:23:26,858 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:26,907 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-16 04:23:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:23:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-16 04:23:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:26,916 INFO L225 Difference]: With dead ends: 183 [2023-12-16 04:23:26,916 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 04:23:26,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:23:26,923 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:26,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 04:23:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 04:23:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-16 04:23:26,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-16 04:23:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-16 04:23:26,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-16 04:23:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:23:26,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:26,974 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:23:26,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:26,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1742220379, now seen corresponding path program 1 times [2023-12-16 04:23:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820596467] [2023-12-16 04:23:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820596467] [2023-12-16 04:23:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820596467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:27,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:23:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901949767] [2023-12-16 04:23:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:23:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:23:27,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:27,402 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:27,455 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-16 04:23:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:23:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-16 04:23:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:27,456 INFO L225 Difference]: With dead ends: 177 [2023-12-16 04:23:27,456 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 04:23:27,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:27,458 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:27,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 04:23:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 04:23:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-16 04:23:27,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-16 04:23:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:27,465 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-16 04:23:27,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-16 04:23:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:23:27,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:27,467 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:23:27,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:27,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -851152689, now seen corresponding path program 1 times [2023-12-16 04:23:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79112123] [2023-12-16 04:23:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:28,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79112123] [2023-12-16 04:23:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79112123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:23:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305451891] [2023-12-16 04:23:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:28,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:23:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:23:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:23:28,582 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:28,858 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2023-12-16 04:23:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:23:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-16 04:23:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:28,860 INFO L225 Difference]: With dead ends: 225 [2023-12-16 04:23:28,860 INFO L226 Difference]: Without dead ends: 137 [2023-12-16 04:23:28,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:23:28,861 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 284 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:28,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 448 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:23:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-16 04:23:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2023-12-16 04:23:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-12-16 04:23:28,876 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2023-12-16 04:23:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:28,877 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-12-16 04:23:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-12-16 04:23:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:23:28,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:28,878 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:23:28,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:28,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -33504239, now seen corresponding path program 1 times [2023-12-16 04:23:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:28,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504800402] [2023-12-16 04:23:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504800402] [2023-12-16 04:23:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504800402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:23:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840478877] [2023-12-16 04:23:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:23:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:23:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:23:29,017 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:29,108 INFO L93 Difference]: Finished difference Result 240 states and 340 transitions. [2023-12-16 04:23:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:23:29,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2023-12-16 04:23:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:29,109 INFO L225 Difference]: With dead ends: 240 [2023-12-16 04:23:29,109 INFO L226 Difference]: Without dead ends: 133 [2023-12-16 04:23:29,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:29,111 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 130 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:29,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 316 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-16 04:23:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2023-12-16 04:23:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2023-12-16 04:23:29,118 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 115 [2023-12-16 04:23:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:29,119 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2023-12-16 04:23:29,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2023-12-16 04:23:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:23:29,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:29,120 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:29,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:23:29,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:29,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1544613980, now seen corresponding path program 1 times [2023-12-16 04:23:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168584909] [2023-12-16 04:23:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168584909] [2023-12-16 04:23:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168584909] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:23:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434811452] [2023-12-16 04:23:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:23:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:23:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:29,260 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:29,300 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2023-12-16 04:23:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:23:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-16 04:23:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:29,302 INFO L225 Difference]: With dead ends: 196 [2023-12-16 04:23:29,302 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 04:23:29,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:29,306 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 477 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:23:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 477 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 04:23:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2023-12-16 04:23:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2023-12-16 04:23:29,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 117 [2023-12-16 04:23:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:29,324 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2023-12-16 04:23:29,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2023-12-16 04:23:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:23:29,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:29,326 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:29,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:23:29,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:29,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1014613558, now seen corresponding path program 1 times [2023-12-16 04:23:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403475356] [2023-12-16 04:23:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403475356] [2023-12-16 04:23:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403475356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:23:29,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529421610] [2023-12-16 04:23:29,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:29,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:23:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:23:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:23:29,491 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:29,559 INFO L93 Difference]: Finished difference Result 219 states and 306 transitions. [2023-12-16 04:23:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:23:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:23:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:29,562 INFO L225 Difference]: With dead ends: 219 [2023-12-16 04:23:29,562 INFO L226 Difference]: Without dead ends: 128 [2023-12-16 04:23:29,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:23:29,564 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:29,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 638 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-16 04:23:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2023-12-16 04:23:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2023-12-16 04:23:29,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 119 [2023-12-16 04:23:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:29,577 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2023-12-16 04:23:29,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2023-12-16 04:23:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:23:29,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:29,577 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:29,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:23:29,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:29,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1451557819, now seen corresponding path program 1 times [2023-12-16 04:23:29,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:29,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826887056] [2023-12-16 04:23:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826887056] [2023-12-16 04:23:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826887056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:30,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:23:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11013712] [2023-12-16 04:23:30,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:30,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:23:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:30,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:23:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:30,064 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:30,271 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2023-12-16 04:23:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:23:30,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-16 04:23:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:30,273 INFO L225 Difference]: With dead ends: 260 [2023-12-16 04:23:30,273 INFO L226 Difference]: Without dead ends: 168 [2023-12-16 04:23:30,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:23:30,273 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 268 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:30,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 382 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:23:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-16 04:23:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 105. [2023-12-16 04:23:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2023-12-16 04:23:30,281 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 121 [2023-12-16 04:23:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:30,282 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2023-12-16 04:23:30,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2023-12-16 04:23:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:23:30,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:30,283 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:30,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:23:30,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:30,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1964916067, now seen corresponding path program 1 times [2023-12-16 04:23:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173473560] [2023-12-16 04:23:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173473560] [2023-12-16 04:23:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173473560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:30,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:30,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:23:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56748082] [2023-12-16 04:23:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:30,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:23:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:23:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:23:30,437 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:30,468 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2023-12-16 04:23:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:23:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-16 04:23:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:30,470 INFO L225 Difference]: With dead ends: 209 [2023-12-16 04:23:30,470 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 04:23:30,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:23:30,471 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 33 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:30,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 305 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 04:23:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-16 04:23:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2023-12-16 04:23:30,478 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 121 [2023-12-16 04:23:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:30,478 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2023-12-16 04:23:30,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2023-12-16 04:23:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:23:30,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:30,480 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:30,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:23:30,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:30,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -83342592, now seen corresponding path program 1 times [2023-12-16 04:23:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725153809] [2023-12-16 04:23:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725153809] [2023-12-16 04:23:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725153809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:30,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:23:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184547941] [2023-12-16 04:23:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:23:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:23:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:30,687 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:30,765 INFO L93 Difference]: Finished difference Result 210 states and 288 transitions. [2023-12-16 04:23:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:23:30,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-16 04:23:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:30,767 INFO L225 Difference]: With dead ends: 210 [2023-12-16 04:23:30,767 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 04:23:30,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:23:30,767 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 8 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:30,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 04:23:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2023-12-16 04:23:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2023-12-16 04:23:30,774 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 123 [2023-12-16 04:23:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:30,774 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2023-12-16 04:23:30,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2023-12-16 04:23:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-16 04:23:30,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:30,775 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:30,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:23:30,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:30,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -617947089, now seen corresponding path program 1 times [2023-12-16 04:23:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246443973] [2023-12-16 04:23:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246443973] [2023-12-16 04:23:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246443973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:23:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004650740] [2023-12-16 04:23:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:31,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:23:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:23:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:23:31,663 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:32,340 INFO L93 Difference]: Finished difference Result 300 states and 407 transitions. [2023-12-16 04:23:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:23:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2023-12-16 04:23:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:32,341 INFO L225 Difference]: With dead ends: 300 [2023-12-16 04:23:32,341 INFO L226 Difference]: Without dead ends: 196 [2023-12-16 04:23:32,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:23:32,342 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 430 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:32,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 762 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:23:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-16 04:23:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2023-12-16 04:23:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 163 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:23:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2023-12-16 04:23:32,357 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 123 [2023-12-16 04:23:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:32,357 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2023-12-16 04:23:32,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2023-12-16 04:23:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 04:23:32,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:32,358 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:32,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:23:32,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:32,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1585642587, now seen corresponding path program 1 times [2023-12-16 04:23:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545820450] [2023-12-16 04:23:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545820450] [2023-12-16 04:23:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545820450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:32,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:23:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604889763] [2023-12-16 04:23:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:32,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:23:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:23:32,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:23:32,656 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:32,905 INFO L93 Difference]: Finished difference Result 396 states and 534 transitions. [2023-12-16 04:23:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:23:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-12-16 04:23:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:32,907 INFO L225 Difference]: With dead ends: 396 [2023-12-16 04:23:32,907 INFO L226 Difference]: Without dead ends: 212 [2023-12-16 04:23:32,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:23:32,908 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 202 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:32,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 664 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:23:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-16 04:23:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 154. [2023-12-16 04:23:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 136 states have internal predecessors, (173), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 203 transitions. [2023-12-16 04:23:32,924 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 203 transitions. Word has length 124 [2023-12-16 04:23:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:32,924 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 203 transitions. [2023-12-16 04:23:32,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 203 transitions. [2023-12-16 04:23:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:23:32,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:32,925 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:32,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:23:32,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:32,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1639445766, now seen corresponding path program 1 times [2023-12-16 04:23:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218562541] [2023-12-16 04:23:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218562541] [2023-12-16 04:23:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218562541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:23:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505324329] [2023-12-16 04:23:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:32,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:23:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:32,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:23:32,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:32,989 INFO L87 Difference]: Start difference. First operand 154 states and 203 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:33,012 INFO L93 Difference]: Finished difference Result 311 states and 413 transitions. [2023-12-16 04:23:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:23:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-16 04:23:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:33,015 INFO L225 Difference]: With dead ends: 311 [2023-12-16 04:23:33,015 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 04:23:33,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:33,016 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:33,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 04:23:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-12-16 04:23:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2023-12-16 04:23:33,031 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 125 [2023-12-16 04:23:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:33,031 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2023-12-16 04:23:33,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2023-12-16 04:23:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:23:33,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:33,032 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:33,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:23:33,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:33,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash -49497976, now seen corresponding path program 1 times [2023-12-16 04:23:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390880940] [2023-12-16 04:23:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:33,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:33,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390880940] [2023-12-16 04:23:33,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390880940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:23:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900826900] [2023-12-16 04:23:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:33,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:23:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:33,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:23:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:33,607 INFO L87 Difference]: Start difference. First operand 158 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:33,983 INFO L93 Difference]: Finished difference Result 362 states and 467 transitions. [2023-12-16 04:23:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:23:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-16 04:23:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:33,986 INFO L225 Difference]: With dead ends: 362 [2023-12-16 04:23:33,986 INFO L226 Difference]: Without dead ends: 205 [2023-12-16 04:23:33,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:23:33,987 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 150 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:33,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 494 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:23:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-16 04:23:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 156. [2023-12-16 04:23:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2023-12-16 04:23:34,000 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 125 [2023-12-16 04:23:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:34,001 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2023-12-16 04:23:34,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2023-12-16 04:23:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:23:34,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:34,003 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:23:34,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:34,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2025691798, now seen corresponding path program 1 times [2023-12-16 04:23:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004941951] [2023-12-16 04:23:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004941951] [2023-12-16 04:23:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004941951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:23:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448000066] [2023-12-16 04:23:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:34,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:23:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:23:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:34,450 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:34,615 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2023-12-16 04:23:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:23:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-16 04:23:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:34,616 INFO L225 Difference]: With dead ends: 208 [2023-12-16 04:23:34,616 INFO L226 Difference]: Without dead ends: 206 [2023-12-16 04:23:34,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:23:34,617 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 166 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:34,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 476 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-16 04:23:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2023-12-16 04:23:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.2215909090909092) internal successors, (215), 176 states have internal predecessors, (215), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 245 transitions. [2023-12-16 04:23:34,629 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 245 transitions. Word has length 125 [2023-12-16 04:23:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:34,629 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 245 transitions. [2023-12-16 04:23:34,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2023-12-16 04:23:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-16 04:23:34,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:34,630 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:34,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:23:34,631 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:34,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash 198508777, now seen corresponding path program 1 times [2023-12-16 04:23:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967834692] [2023-12-16 04:23:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:34,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967834692] [2023-12-16 04:23:34,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967834692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:34,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:34,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:23:34,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357859002] [2023-12-16 04:23:34,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:34,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:23:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:23:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:34,833 INFO L87 Difference]: Start difference. First operand 194 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:35,007 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2023-12-16 04:23:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:23:35,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2023-12-16 04:23:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:35,009 INFO L225 Difference]: With dead ends: 433 [2023-12-16 04:23:35,009 INFO L226 Difference]: Without dead ends: 240 [2023-12-16 04:23:35,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:23:35,011 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 237 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:35,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 440 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-16 04:23:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194. [2023-12-16 04:23:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.2102272727272727) internal successors, (213), 176 states have internal predecessors, (213), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 243 transitions. [2023-12-16 04:23:35,038 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 243 transitions. Word has length 125 [2023-12-16 04:23:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:35,038 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 243 transitions. [2023-12-16 04:23:35,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 243 transitions. [2023-12-16 04:23:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:23:35,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:35,039 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:35,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:23:35,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:35,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2043928865, now seen corresponding path program 1 times [2023-12-16 04:23:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701546967] [2023-12-16 04:23:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701546967] [2023-12-16 04:23:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701546967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:23:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352130380] [2023-12-16 04:23:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:35,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:23:35,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:23:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:23:35,317 INFO L87 Difference]: Start difference. First operand 194 states and 243 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:35,650 INFO L93 Difference]: Finished difference Result 520 states and 657 transitions. [2023-12-16 04:23:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:23:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-12-16 04:23:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:35,652 INFO L225 Difference]: With dead ends: 520 [2023-12-16 04:23:35,652 INFO L226 Difference]: Without dead ends: 327 [2023-12-16 04:23:35,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:23:35,653 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 311 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:35,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1110 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-16 04:23:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 252. [2023-12-16 04:23:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 234 states have internal predecessors, (284), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2023-12-16 04:23:35,673 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 126 [2023-12-16 04:23:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:35,673 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2023-12-16 04:23:35,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:23:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2023-12-16 04:23:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 04:23:35,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:35,674 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:35,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:23:35,674 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:35,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash -120700831, now seen corresponding path program 1 times [2023-12-16 04:23:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116079596] [2023-12-16 04:23:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116079596] [2023-12-16 04:23:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116079596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:35,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:35,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:23:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860217237] [2023-12-16 04:23:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:35,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:23:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:23:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:35,850 INFO L87 Difference]: Start difference. First operand 252 states and 314 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:35,956 INFO L93 Difference]: Finished difference Result 556 states and 694 transitions. [2023-12-16 04:23:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:23:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-16 04:23:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:35,959 INFO L225 Difference]: With dead ends: 556 [2023-12-16 04:23:35,959 INFO L226 Difference]: Without dead ends: 305 [2023-12-16 04:23:35,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:23:35,960 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 88 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:35,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 409 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-16 04:23:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 220. [2023-12-16 04:23:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 202 states have internal predecessors, (245), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:23:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 275 transitions. [2023-12-16 04:23:35,976 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 275 transitions. Word has length 126 [2023-12-16 04:23:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:35,976 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 275 transitions. [2023-12-16 04:23:35,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 275 transitions. [2023-12-16 04:23:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 04:23:35,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:35,978 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:35,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:23:35,978 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:35,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1754590603, now seen corresponding path program 1 times [2023-12-16 04:23:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936817619] [2023-12-16 04:23:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:23:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936817619] [2023-12-16 04:23:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936817619] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:23:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615627916] [2023-12-16 04:23:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:36,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:23:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:23:36,436 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:23:36,455 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:23:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:36,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 04:23:36,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:23:36,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:23:37,241 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-16 04:23:37,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-12-16 04:23:37,288 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-16 04:23:37,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2023-12-16 04:23:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-16 04:23:37,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:23:37,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-12-16 04:23:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:23:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615627916] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:23:37,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:23:37,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2023-12-16 04:23:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114676319] [2023-12-16 04:23:37,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:23:37,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 04:23:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 04:23:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:23:37,622 INFO L87 Difference]: Start difference. First operand 220 states and 275 transitions. Second operand has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) [2023-12-16 04:23:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:38,332 INFO L93 Difference]: Finished difference Result 424 states and 518 transitions. [2023-12-16 04:23:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:23:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) Word has length 127 [2023-12-16 04:23:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:38,334 INFO L225 Difference]: With dead ends: 424 [2023-12-16 04:23:38,334 INFO L226 Difference]: Without dead ends: 205 [2023-12-16 04:23:38,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 04:23:38,335 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 257 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:38,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 751 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:23:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-16 04:23:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2023-12-16 04:23:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.138728323699422) internal successors, (197), 174 states have internal predecessors, (197), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:23:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2023-12-16 04:23:38,352 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 127 [2023-12-16 04:23:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:38,353 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2023-12-16 04:23:38,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) [2023-12-16 04:23:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2023-12-16 04:23:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 04:23:38,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:38,355 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:38,364 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:23:38,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 04:23:38,561 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:38,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1935207474, now seen corresponding path program 1 times [2023-12-16 04:23:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:38,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693317830] [2023-12-16 04:23:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693317830] [2023-12-16 04:23:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693317830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:23:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482000003] [2023-12-16 04:23:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:23:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:23:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:38,707 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:38,758 INFO L93 Difference]: Finished difference Result 306 states and 368 transitions. [2023-12-16 04:23:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:23:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-16 04:23:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:38,760 INFO L225 Difference]: With dead ends: 306 [2023-12-16 04:23:38,760 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 04:23:38,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:23:38,761 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:38,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 04:23:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-16 04:23:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.108695652173913) internal successors, (102), 93 states have internal predecessors, (102), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:23:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2023-12-16 04:23:38,777 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 127 [2023-12-16 04:23:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:38,777 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2023-12-16 04:23:38,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2023-12-16 04:23:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:23:38,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:38,778 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:23:38,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:38,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1730744439, now seen corresponding path program 1 times [2023-12-16 04:23:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617843905] [2023-12-16 04:23:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:38,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617843905] [2023-12-16 04:23:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617843905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:38,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:23:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255398755] [2023-12-16 04:23:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:38,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:23:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:38,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:23:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:38,877 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:38,903 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2023-12-16 04:23:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:23:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 04:23:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:38,904 INFO L225 Difference]: With dead ends: 225 [2023-12-16 04:23:38,904 INFO L226 Difference]: Without dead ends: 117 [2023-12-16 04:23:38,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:23:38,905 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:38,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:23:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-16 04:23:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2023-12-16 04:23:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 04:23:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-12-16 04:23:38,925 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 128 [2023-12-16 04:23:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:38,925 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-12-16 04:23:38,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-12-16 04:23:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-16 04:23:38,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:23:38,926 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:23:38,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:23:38,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:23:38,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:23:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 44262923, now seen corresponding path program 1 times [2023-12-16 04:23:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:23:38,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302665166] [2023-12-16 04:23:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:23:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:23:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:23:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:23:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:23:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:23:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:23:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 04:23:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 04:23:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:23:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 04:23:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 04:23:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 04:23:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 04:23:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:23:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 04:23:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:23:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:23:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:23:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:23:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302665166] [2023-12-16 04:23:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302665166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:23:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:23:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:23:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572612747] [2023-12-16 04:23:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:23:39,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:23:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:23:39,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:23:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:23:39,138 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:23:39,300 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2023-12-16 04:23:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:23:39,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-16 04:23:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:23:39,301 INFO L225 Difference]: With dead ends: 212 [2023-12-16 04:23:39,301 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:23:39,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:23:39,302 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:23:39,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:23:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:23:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:23:39,302 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:23:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:23:39,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-12-16 04:23:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:23:39,303 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:23:39,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:23:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:23:39,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:23:39,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:23:39,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:23:39,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:23:45,931 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 161 DAG size of output: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-16 04:23:48,541 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 85) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 04:23:48,541 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 75) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 71 75) no Hoare annotation was computed. [2023-12-16 04:23:48,542 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-12-16 04:23:48,542 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-16 04:23:48,543 INFO L895 garLoopResultBuilder]: At program point L121-2(lines 121 127) the Hoare annotation is: (let ((.cse14 (+ |~#signed_char_Array_0~0.offset| 2))) (let ((.cse1 (let ((.cse15 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse16 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse17 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse18 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse19 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse20 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse21 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse21) (and .cse15 .cse16 .cse17 .cse18 .cse19 (let ((.cse22 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse25 (+ .cse22 240))) (let ((.cse23 (* 256 (div .cse25 256))) (.cse24 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse22 (+ 16 .cse23 .cse24)) (<= .cse22 (+ 15 (* (div (+ 112 .cse22) 256) 256)))) (and (<= (+ .cse22 113) .cse23) (= (+ .cse23 .cse24) .cse25)))))) .cse20 .cse21)))) (.cse2 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse4 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (.cse5 (not (= .cse14 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1)) (.cse8 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse9 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse14))) (.cse10 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse11 (= |~#BOOL_unsigned_char_Array_0~0.offset| 0)) (.cse12 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) (or (and (let ((.cse0 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (<= .cse0 (* 256 (div .cse0 256)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (let ((.cse13 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse13 (* (div .cse13 256) 256))))))) [2023-12-16 04:23:48,543 INFO L899 garLoopResultBuilder]: For program point L121-3(lines 121 127) no Hoare annotation was computed. [2023-12-16 04:23:48,543 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,543 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-16 04:23:48,543 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 74) no Hoare annotation was computed. [2023-12-16 04:23:48,543 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-12-16 04:23:48,543 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-16 04:23:48,543 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,543 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-16 04:23:48,544 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-16 04:23:48,544 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-16 04:23:48,544 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:23:48,545 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-12-16 04:23:48,545 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-16 04:23:48,545 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= |ULTIMATE.start_updateVariables_#t~mem37#1| (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 84) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L60-2(line 60) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L77-2(lines 77 81) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,546 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse13 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse13 (* (div .cse13 256) 256))))) [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-16 04:23:48,547 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 67) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 59 69) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 04:23:48,548 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,549 INFO L899 garLoopResultBuilder]: For program point L115-2(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,549 INFO L899 garLoopResultBuilder]: For program point L115-3(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,549 INFO L899 garLoopResultBuilder]: For program point L115-4(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-5(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-6(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-8(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-10(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-12(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-14(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-15(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-16(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-17(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-19(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,550 INFO L899 garLoopResultBuilder]: For program point L115-21(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-23(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-25(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-26(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-27(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-29(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-30(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-31(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-32(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-34(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-35(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,551 INFO L899 garLoopResultBuilder]: For program point L115-37(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,552 INFO L899 garLoopResultBuilder]: For program point L115-39(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,552 INFO L899 garLoopResultBuilder]: For program point L115-41(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,552 INFO L899 garLoopResultBuilder]: For program point L115-43(line 115) no Hoare annotation was computed. [2023-12-16 04:23:48,552 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-12-16 04:23:48,552 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-16 04:23:48,555 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] [2023-12-16 04:23:48,556 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:23:48,581 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,584 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,584 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,584 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,585 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,585 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,585 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,586 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,587 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,587 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,592 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated [2023-12-16 04:23:48,593 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated [2023-12-16 04:23:48,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:23:48 BoogieIcfgContainer [2023-12-16 04:23:48,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:23:48,595 INFO L158 Benchmark]: Toolchain (without parser) took 23151.20ms. Allocated memory was 229.6MB in the beginning and 690.0MB in the end (delta: 460.3MB). Free memory was 181.8MB in the beginning and 569.9MB in the end (delta: -388.0MB). Peak memory consumption was 407.3MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,595 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 126.1MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:23:48,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.53ms. Allocated memory is still 229.6MB. Free memory was 181.8MB in the beginning and 167.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.82ms. Allocated memory is still 229.6MB. Free memory was 166.6MB in the beginning and 163.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,598 INFO L158 Benchmark]: Boogie Preprocessor took 71.46ms. Allocated memory is still 229.6MB. Free memory was 163.5MB in the beginning and 159.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,598 INFO L158 Benchmark]: RCFGBuilder took 610.50ms. Allocated memory is still 229.6MB. Free memory was 158.8MB in the beginning and 193.8MB in the end (delta: -35.0MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,600 INFO L158 Benchmark]: TraceAbstraction took 22187.86ms. Allocated memory was 229.6MB in the beginning and 690.0MB in the end (delta: 460.3MB). Free memory was 193.3MB in the beginning and 569.9MB in the end (delta: -376.6MB). Peak memory consumption was 417.7MB. Max. memory is 8.0GB. [2023-12-16 04:23:48,602 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.39ms. Allocated memory is still 181.4MB. Free memory was 126.2MB in the beginning and 126.1MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.53ms. Allocated memory is still 229.6MB. Free memory was 181.8MB in the beginning and 167.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.82ms. Allocated memory is still 229.6MB. Free memory was 166.6MB in the beginning and 163.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.46ms. Allocated memory is still 229.6MB. Free memory was 163.5MB in the beginning and 159.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 610.50ms. Allocated memory is still 229.6MB. Free memory was 158.8MB in the beginning and 193.8MB in the end (delta: -35.0MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. * TraceAbstraction took 22187.86ms. Allocated memory was 229.6MB in the beginning and 690.0MB in the end (delta: 460.3MB). Free memory was 193.3MB in the beginning and 569.9MB in the end (delta: -376.6MB). Peak memory consumption was 417.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated * 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: 19]: 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 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2761 mSDsluCounter, 9482 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6818 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2720 IncrementalHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 2664 mSDtfsCounter, 2720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 929 SyntacticMatches, 4 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=16, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 538 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 340 PreInvPairs, 359 NumberOfFragments, 2518 HoareAnnotationTreeSize, 340 FormulaSimplifications, 88148 FormulaSimplificationTreeSizeReduction, 6.9s HoareSimplificationTime, 17 FormulaSimplificationsInter, 60502 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2695 NumberOfCodeBlocks, 2695 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2799 ConstructedInterpolants, 5 QuantifiedInterpolants, 12541 SizeOfPredicates, 11 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 9417/9660 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 1 specifications checked. All of them hold - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-16 04:23:48,624 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...