/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:32:24,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:32:24,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:32:24,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:32:24,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:32:24,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:32:24,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:32:24,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:32:24,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:32:24,651 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:32:24,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:32:24,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:32:24,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:32:24,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:32:24,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:32:24,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:32:24,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:32:24,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:32:24,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:32:24,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:32:24,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:32:24,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:32:24,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:32:24,657 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:32:24,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:32:24,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:32:24,658 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:32:24,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:32:24,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:32:24,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:32:24,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:32:24,845 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:32:24,846 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-15.i [2023-12-15 21:32:25,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:32:25,936 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:32:25,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2023-12-15 21:32:25,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2577f5214/cd29b28810c14880a8a24eeb24897d7d/FLAG8100f7c27 [2023-12-15 21:32:25,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2577f5214/cd29b28810c14880a8a24eeb24897d7d [2023-12-15 21:32:25,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:32:25,962 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:32:25,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:32:25,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:32:25,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:32:25,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:32:25" (1/1) ... [2023-12-15 21:32:25,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112ef68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:25, skipping insertion in model container [2023-12-15 21:32:25,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:32:25" (1/1) ... [2023-12-15 21:32:25,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:32:26,119 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-15.i[917,930] [2023-12-15 21:32:26,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:32:26,200 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:32:26,210 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-15.i[917,930] [2023-12-15 21:32:26,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:32:26,255 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:32:26,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26 WrapperNode [2023-12-15 21:32:26,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:32:26,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:32:26,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:32:26,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:32:26,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,293 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2023-12-15 21:32:26,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:32:26,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:32:26,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:32:26,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:32:26,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,320 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2023-12-15 21:32:26,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:32:26,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:32:26,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:32:26,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:32:26,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (1/1) ... [2023-12-15 21:32:26,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:32:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:26,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:32:26,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:32:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:32:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:32:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:32:26,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:32:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:32:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:32:26,535 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:32:26,536 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:32:26,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:32:26,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:32:26,864 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:32:26,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:32:26 BoogieIcfgContainer [2023-12-15 21:32:26,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:32:26,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:32:26,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:32:26,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:32:26,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:32:25" (1/3) ... [2023-12-15 21:32:26,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce954e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:32:26, skipping insertion in model container [2023-12-15 21:32:26,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:32:26" (2/3) ... [2023-12-15 21:32:26,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce954e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:32:26, skipping insertion in model container [2023-12-15 21:32:26,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:32:26" (3/3) ... [2023-12-15 21:32:26,871 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2023-12-15 21:32:26,882 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:32:26,882 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:32:26,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:32:26,920 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;@760f1702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:32:26,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:32:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:32:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:32:26,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:26,931 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:26,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:26,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -205603853, now seen corresponding path program 1 times [2023-12-15 21:32:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836541394] [2023-12-15 21:32:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836541394] [2023-12-15 21:32:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836541394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:32:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533509193] [2023-12-15 21:32:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:32:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:32:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:32:27,239 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:27,277 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-15 21:32:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:32:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-15 21:32:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:27,287 INFO L225 Difference]: With dead ends: 209 [2023-12-15 21:32:27,287 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 21:32:27,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:32:27,293 INFO L413 NwaCegarLoop]: 148 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, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:27,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 21:32:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-15 21:32:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:32:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-15 21:32:27,321 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-15 21:32:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:27,322 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-15 21:32:27,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-15 21:32:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:32:27,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:27,324 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:32:27,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:27,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 101125605, now seen corresponding path program 1 times [2023-12-15 21:32:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5284178] [2023-12-15 21:32:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5284178] [2023-12-15 21:32:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5284178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:32:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230768562] [2023-12-15 21:32:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:27,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:32:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:32:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:32:27,568 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:27,631 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-12-15 21:32:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-15 21:32:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:27,636 INFO L225 Difference]: With dead ends: 213 [2023-12-15 21:32:27,636 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 21:32:27,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:27,637 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:27,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 21:32:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-12-15 21:32:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:32:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-15 21:32:27,645 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-15 21:32:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:27,646 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-15 21:32:27,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-15 21:32:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:32:27,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:27,647 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:32:27,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:27,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 833093031, now seen corresponding path program 1 times [2023-12-15 21:32:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560834485] [2023-12-15 21:32:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:27,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560834485] [2023-12-15 21:32:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560834485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:32:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839833542] [2023-12-15 21:32:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:27,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:32:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:32:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:32:27,816 INFO L87 Difference]: Start difference. First operand 106 states and 154 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:27,846 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-12-15 21:32:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:32:27,847 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-15 21:32:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:27,848 INFO L225 Difference]: With dead ends: 212 [2023-12-15 21:32:27,848 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 21:32:27,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:32:27,852 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:27,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 21:32:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-15 21:32:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:32:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-15 21:32:27,863 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 110 [2023-12-15 21:32:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:27,863 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-15 21:32:27,864 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-15 21:32:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:32:27,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:27,865 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:27,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:32:27,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:27,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1161051675, now seen corresponding path program 1 times [2023-12-15 21:32:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142027875] [2023-12-15 21:32:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142027875] [2023-12-15 21:32:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142027875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:32:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339573462] [2023-12-15 21:32:27,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:27,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:32:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:32:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:32:27,975 INFO L87 Difference]: Start difference. First operand 107 states and 155 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:28,027 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-12-15 21:32:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:32:28,028 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-15 21:32:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:28,030 INFO L225 Difference]: With dead ends: 237 [2023-12-15 21:32:28,030 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 21:32:28,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:32:28,033 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:28,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 21:32:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-15 21:32:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:32:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-12-15 21:32:28,039 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2023-12-15 21:32:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:28,039 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-12-15 21:32:28,039 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-12-15 21:32:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:32:28,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:28,041 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:32:28,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:28,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -459987097, now seen corresponding path program 1 times [2023-12-15 21:32:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141162858] [2023-12-15 21:32:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141162858] [2023-12-15 21:32:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141162858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:32:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861129582] [2023-12-15 21:32:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:28,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:32:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:32:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:32:28,568 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:28,766 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2023-12-15 21:32:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:32:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2023-12-15 21:32:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:28,769 INFO L225 Difference]: With dead ends: 322 [2023-12-15 21:32:28,769 INFO L226 Difference]: Without dead ends: 215 [2023-12-15 21:32:28,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:32:28,770 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 439 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:28,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 766 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:32:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-15 21:32:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2023-12-15 21:32:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 169 states have internal predecessors, (236), 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-15 21:32:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2023-12-15 21:32:28,799 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 110 [2023-12-15 21:32:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:28,800 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2023-12-15 21:32:28,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2023-12-15 21:32:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:32:28,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:28,803 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:32:28,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:28,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -999513403, now seen corresponding path program 1 times [2023-12-15 21:32:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909243763] [2023-12-15 21:32:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:29,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:29,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909243763] [2023-12-15 21:32:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909243763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:32:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656215443] [2023-12-15 21:32:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:32:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:32:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:29,113 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:29,238 INFO L93 Difference]: Finished difference Result 613 states and 887 transitions. [2023-12-15 21:32:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:29,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-15 21:32:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:29,241 INFO L225 Difference]: With dead ends: 613 [2023-12-15 21:32:29,241 INFO L226 Difference]: Without dead ends: 423 [2023-12-15 21:32:29,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:32:29,243 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 242 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:29,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 718 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:32:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-15 21:32:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2023-12-15 21:32:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.4054878048780488) internal successors, (461), 330 states have internal predecessors, (461), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:32:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 541 transitions. [2023-12-15 21:32:29,268 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 541 transitions. Word has length 111 [2023-12-15 21:32:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:29,269 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 541 transitions. [2023-12-15 21:32:29,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 541 transitions. [2023-12-15 21:32:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 21:32:29,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:29,270 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:32:29,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:29,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1444705491, now seen corresponding path program 1 times [2023-12-15 21:32:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:29,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528670207] [2023-12-15 21:32:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:29,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528670207] [2023-12-15 21:32:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528670207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297795165] [2023-12-15 21:32:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:29,495 INFO L87 Difference]: Start difference. First operand 373 states and 541 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:29,560 INFO L93 Difference]: Finished difference Result 749 states and 1085 transitions. [2023-12-15 21:32:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:29,560 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-15 21:32:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:29,562 INFO L225 Difference]: With dead ends: 749 [2023-12-15 21:32:29,562 INFO L226 Difference]: Without dead ends: 377 [2023-12-15 21:32:29,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:29,564 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:29,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 581 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-15 21:32:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2023-12-15 21:32:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 329 states have internal predecessors, (459), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:32:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2023-12-15 21:32:29,588 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 112 [2023-12-15 21:32:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:29,589 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2023-12-15 21:32:29,589 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2023-12-15 21:32:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:32:29,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:29,594 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:32:29,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:29,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1643999055, now seen corresponding path program 1 times [2023-12-15 21:32:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962129319] [2023-12-15 21:32:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:29,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962129319] [2023-12-15 21:32:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962129319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:32:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304829783] [2023-12-15 21:32:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:29,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:32:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:32:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:29,788 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:29,895 INFO L93 Difference]: Finished difference Result 956 states and 1382 transitions. [2023-12-15 21:32:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:32:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-15 21:32:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:29,900 INFO L225 Difference]: With dead ends: 956 [2023-12-15 21:32:29,900 INFO L226 Difference]: Without dead ends: 585 [2023-12-15 21:32:29,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:32:29,901 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 190 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:29,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 966 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:32:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-15 21:32:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 397. [2023-12-15 21:32:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 352 states have (on average 1.40625) internal successors, (495), 354 states have internal predecessors, (495), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:32:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 575 transitions. [2023-12-15 21:32:29,921 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 575 transitions. Word has length 113 [2023-12-15 21:32:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:29,921 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 575 transitions. [2023-12-15 21:32:29,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 575 transitions. [2023-12-15 21:32:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:32:29,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:29,923 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:32:29,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:29,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 703473728, now seen corresponding path program 1 times [2023-12-15 21:32:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576872082] [2023-12-15 21:32:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:30,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:30,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576872082] [2023-12-15 21:32:30,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576872082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:30,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:30,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498426722] [2023-12-15 21:32:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:30,167 INFO L87 Difference]: Start difference. First operand 397 states and 575 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:30,230 INFO L93 Difference]: Finished difference Result 1045 states and 1508 transitions. [2023-12-15 21:32:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:30,230 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-15 21:32:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:30,232 INFO L225 Difference]: With dead ends: 1045 [2023-12-15 21:32:30,232 INFO L226 Difference]: Without dead ends: 649 [2023-12-15 21:32:30,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:30,234 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 137 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:30,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 640 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-12-15 21:32:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 462. [2023-12-15 21:32:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 417 states have (on average 1.410071942446043) internal successors, (588), 419 states have internal predecessors, (588), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:32:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 668 transitions. [2023-12-15 21:32:30,259 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 668 transitions. Word has length 113 [2023-12-15 21:32:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:30,259 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 668 transitions. [2023-12-15 21:32:30,259 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 668 transitions. [2023-12-15 21:32:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:32:30,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:30,260 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:32:30,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:30,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -529810965, now seen corresponding path program 1 times [2023-12-15 21:32:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367934264] [2023-12-15 21:32:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:30,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367934264] [2023-12-15 21:32:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367934264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:30,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035874092] [2023-12-15 21:32:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:30,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:30,423 INFO L87 Difference]: Start difference. First operand 462 states and 668 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:30,485 INFO L93 Difference]: Finished difference Result 1058 states and 1523 transitions. [2023-12-15 21:32:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:30,485 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-15 21:32:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:30,488 INFO L225 Difference]: With dead ends: 1058 [2023-12-15 21:32:30,488 INFO L226 Difference]: Without dead ends: 597 [2023-12-15 21:32:30,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:30,489 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:30,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 625 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-12-15 21:32:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 461. [2023-12-15 21:32:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 416 states have (on average 1.40625) internal successors, (585), 418 states have internal predecessors, (585), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:32:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 665 transitions. [2023-12-15 21:32:30,510 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 665 transitions. Word has length 113 [2023-12-15 21:32:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:30,510 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 665 transitions. [2023-12-15 21:32:30,510 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 665 transitions. [2023-12-15 21:32:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:32:30,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:30,511 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:30,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:32:30,511 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:30,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2076212589, now seen corresponding path program 1 times [2023-12-15 21:32:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126292313] [2023-12-15 21:32:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126292313] [2023-12-15 21:32:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126292313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:32:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736982250] [2023-12-15 21:32:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:30,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:32:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:32:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:32:30,751 INFO L87 Difference]: Start difference. First operand 461 states and 665 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:30,863 INFO L93 Difference]: Finished difference Result 934 states and 1345 transitions. [2023-12-15 21:32:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:32:30,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-15 21:32:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:30,867 INFO L225 Difference]: With dead ends: 934 [2023-12-15 21:32:30,867 INFO L226 Difference]: Without dead ends: 699 [2023-12-15 21:32:30,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:32:30,868 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 240 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:30,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 676 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:32:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-12-15 21:32:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2023-12-15 21:32:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 600 states have (on average 1.4) internal successors, (840), 603 states have internal predecessors, (840), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-15 21:32:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 960 transitions. [2023-12-15 21:32:30,903 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 960 transitions. Word has length 113 [2023-12-15 21:32:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:30,903 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 960 transitions. [2023-12-15 21:32:30,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 960 transitions. [2023-12-15 21:32:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:32:30,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:30,904 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:30,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:32:30,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:30,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -712443638, now seen corresponding path program 1 times [2023-12-15 21:32:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235600962] [2023-12-15 21:32:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235600962] [2023-12-15 21:32:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235600962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:32:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342401932] [2023-12-15 21:32:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:31,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:32:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:32:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:32:31,328 INFO L87 Difference]: Start difference. First operand 667 states and 960 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:31,645 INFO L93 Difference]: Finished difference Result 1575 states and 2262 transitions. [2023-12-15 21:32:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:32:31,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-15 21:32:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:31,649 INFO L225 Difference]: With dead ends: 1575 [2023-12-15 21:32:31,649 INFO L226 Difference]: Without dead ends: 909 [2023-12-15 21:32:31,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:32:31,651 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 467 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:31,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1121 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-15 21:32:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 783. [2023-12-15 21:32:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 696 states have (on average 1.3936781609195403) internal successors, (970), 701 states have internal predecessors, (970), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:32:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2023-12-15 21:32:31,698 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 114 [2023-12-15 21:32:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:31,698 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2023-12-15 21:32:31,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2023-12-15 21:32:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:32:31,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:31,699 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:31,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:32:31,699 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:31,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1597268296, now seen corresponding path program 1 times [2023-12-15 21:32:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437654808] [2023-12-15 21:32:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437654808] [2023-12-15 21:32:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437654808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:31,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:31,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220795924] [2023-12-15 21:32:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:31,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:31,865 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:31,949 INFO L93 Difference]: Finished difference Result 1723 states and 2463 transitions. [2023-12-15 21:32:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:31,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-15 21:32:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:31,953 INFO L225 Difference]: With dead ends: 1723 [2023-12-15 21:32:31,953 INFO L226 Difference]: Without dead ends: 979 [2023-12-15 21:32:31,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:31,954 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 65 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:31,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 645 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2023-12-15 21:32:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 781. [2023-12-15 21:32:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 694 states have (on average 1.3876080691642652) internal successors, (963), 699 states have internal predecessors, (963), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:32:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1119 transitions. [2023-12-15 21:32:32,021 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1119 transitions. Word has length 114 [2023-12-15 21:32:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:32,022 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1119 transitions. [2023-12-15 21:32:32,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1119 transitions. [2023-12-15 21:32:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:32:32,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:32,023 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:32:32,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:32,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1174388115, now seen corresponding path program 1 times [2023-12-15 21:32:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446509535] [2023-12-15 21:32:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446509535] [2023-12-15 21:32:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446509535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782587838] [2023-12-15 21:32:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:32,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:32,211 INFO L87 Difference]: Start difference. First operand 781 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:32,290 INFO L93 Difference]: Finished difference Result 1741 states and 2482 transitions. [2023-12-15 21:32:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-15 21:32:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:32,294 INFO L225 Difference]: With dead ends: 1741 [2023-12-15 21:32:32,294 INFO L226 Difference]: Without dead ends: 999 [2023-12-15 21:32:32,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:32,296 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 101 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:32,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 667 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-12-15 21:32:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2023-12-15 21:32:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 694 states have (on average 1.377521613832853) internal successors, (956), 699 states have internal predecessors, (956), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-15 21:32:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1112 transitions. [2023-12-15 21:32:32,335 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1112 transitions. Word has length 114 [2023-12-15 21:32:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:32,338 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1112 transitions. [2023-12-15 21:32:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1112 transitions. [2023-12-15 21:32:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:32:32,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:32,339 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:32,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:32:32,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:32,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1761194129, now seen corresponding path program 1 times [2023-12-15 21:32:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445521034] [2023-12-15 21:32:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445521034] [2023-12-15 21:32:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445521034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:32,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:32,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646980269] [2023-12-15 21:32:32,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:32,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:32,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:32,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:32,491 INFO L87 Difference]: Start difference. First operand 781 states and 1112 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:32,567 INFO L93 Difference]: Finished difference Result 1477 states and 2100 transitions. [2023-12-15 21:32:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:32,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-15 21:32:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:32,571 INFO L225 Difference]: With dead ends: 1477 [2023-12-15 21:32:32,571 INFO L226 Difference]: Without dead ends: 1009 [2023-12-15 21:32:32,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:32,572 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 208 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:32,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 832 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-15 21:32:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 980. [2023-12-15 21:32:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 871 states have (on average 1.3742824339839266) internal successors, (1197), 877 states have internal predecessors, (1197), 98 states have call successors, (98), 10 states have call predecessors, (98), 10 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-15 21:32:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1393 transitions. [2023-12-15 21:32:32,643 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1393 transitions. Word has length 114 [2023-12-15 21:32:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:32,643 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1393 transitions. [2023-12-15 21:32:32,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1393 transitions. [2023-12-15 21:32:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:32:32,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:32,644 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:32,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:32:32,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:32,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -134001780, now seen corresponding path program 1 times [2023-12-15 21:32:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217662372] [2023-12-15 21:32:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:32,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217662372] [2023-12-15 21:32:32,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217662372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:32,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:32,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:32:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20114380] [2023-12-15 21:32:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:32,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:32:32,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:32:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:32:32,920 INFO L87 Difference]: Start difference. First operand 980 states and 1393 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:33,234 INFO L93 Difference]: Finished difference Result 2075 states and 2938 transitions. [2023-12-15 21:32:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:32:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-15 21:32:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:33,238 INFO L225 Difference]: With dead ends: 2075 [2023-12-15 21:32:33,238 INFO L226 Difference]: Without dead ends: 1134 [2023-12-15 21:32:33,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:32:33,240 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 517 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:33,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 948 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2023-12-15 21:32:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 868. [2023-12-15 21:32:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 778 states have (on average 1.3714652956298201) internal successors, (1067), 782 states have internal predecessors, (1067), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:32:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1227 transitions. [2023-12-15 21:32:33,287 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1227 transitions. Word has length 115 [2023-12-15 21:32:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:33,287 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1227 transitions. [2023-12-15 21:32:33,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1227 transitions. [2023-12-15 21:32:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:33,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:33,290 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:33,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:32:33,290 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:33,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1737556389, now seen corresponding path program 1 times [2023-12-15 21:32:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480287344] [2023-12-15 21:32:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480287344] [2023-12-15 21:32:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480287344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:32:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462079058] [2023-12-15 21:32:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:32:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:32:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:32:33,671 INFO L87 Difference]: Start difference. First operand 868 states and 1227 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:34,068 INFO L93 Difference]: Finished difference Result 2286 states and 3234 transitions. [2023-12-15 21:32:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:32:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-15 21:32:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:34,072 INFO L225 Difference]: With dead ends: 2286 [2023-12-15 21:32:34,072 INFO L226 Difference]: Without dead ends: 1419 [2023-12-15 21:32:34,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:32:34,074 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 674 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:34,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1334 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2023-12-15 21:32:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 887. [2023-12-15 21:32:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 797 states have (on average 1.3651191969887078) internal successors, (1088), 801 states have internal predecessors, (1088), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-15 21:32:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1248 transitions. [2023-12-15 21:32:34,118 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1248 transitions. Word has length 116 [2023-12-15 21:32:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:34,118 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1248 transitions. [2023-12-15 21:32:34,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1248 transitions. [2023-12-15 21:32:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:34,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:34,119 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:34,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:32:34,119 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:34,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2134709081, now seen corresponding path program 1 times [2023-12-15 21:32:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977797665] [2023-12-15 21:32:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977797665] [2023-12-15 21:32:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977797665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377724779] [2023-12-15 21:32:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:34,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:34,258 INFO L87 Difference]: Start difference. First operand 887 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:34,328 INFO L93 Difference]: Finished difference Result 1605 states and 2255 transitions. [2023-12-15 21:32:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:34,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-15 21:32:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:34,330 INFO L225 Difference]: With dead ends: 1605 [2023-12-15 21:32:34,330 INFO L226 Difference]: Without dead ends: 719 [2023-12-15 21:32:34,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:34,332 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:34,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 635 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-12-15 21:32:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 704. [2023-12-15 21:32:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 622 states have (on average 1.360128617363344) internal successors, (846), 625 states have internal predecessors, (846), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-15 21:32:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 990 transitions. [2023-12-15 21:32:34,361 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 990 transitions. Word has length 116 [2023-12-15 21:32:34,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:34,361 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 990 transitions. [2023-12-15 21:32:34,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 990 transitions. [2023-12-15 21:32:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:34,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:34,363 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:34,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:32:34,363 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:34,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 823475631, now seen corresponding path program 1 times [2023-12-15 21:32:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844482216] [2023-12-15 21:32:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844482216] [2023-12-15 21:32:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844482216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:35,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:32:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632104431] [2023-12-15 21:32:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:35,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:32:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:32:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:32:35,021 INFO L87 Difference]: Start difference. First operand 704 states and 990 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:35,940 INFO L93 Difference]: Finished difference Result 1835 states and 2579 transitions. [2023-12-15 21:32:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:32:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-15 21:32:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:35,945 INFO L225 Difference]: With dead ends: 1835 [2023-12-15 21:32:35,945 INFO L226 Difference]: Without dead ends: 1329 [2023-12-15 21:32:35,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:32:35,946 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 506 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:35,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1979 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:32:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2023-12-15 21:32:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1320. [2023-12-15 21:32:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1162 states have (on average 1.3580034423407918) internal successors, (1578), 1172 states have internal predecessors, (1578), 138 states have call successors, (138), 19 states have call predecessors, (138), 19 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2023-12-15 21:32:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1854 transitions. [2023-12-15 21:32:36,011 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1854 transitions. Word has length 116 [2023-12-15 21:32:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:36,011 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1854 transitions. [2023-12-15 21:32:36,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1854 transitions. [2023-12-15 21:32:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:36,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:36,012 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:32:36,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:36,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 964024241, now seen corresponding path program 1 times [2023-12-15 21:32:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19384691] [2023-12-15 21:32:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19384691] [2023-12-15 21:32:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19384691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:37,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:37,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:32:37,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846766463] [2023-12-15 21:32:37,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:37,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:32:37,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:32:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:32:37,064 INFO L87 Difference]: Start difference. First operand 1320 states and 1854 transitions. Second operand has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-15 21:32:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:39,175 INFO L93 Difference]: Finished difference Result 3489 states and 4867 transitions. [2023-12-15 21:32:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:32:39,176 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2023-12-15 21:32:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:39,181 INFO L225 Difference]: With dead ends: 3489 [2023-12-15 21:32:39,181 INFO L226 Difference]: Without dead ends: 2367 [2023-12-15 21:32:39,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:32:39,184 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1358 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:39,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 3077 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 21:32:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2023-12-15 21:32:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1134. [2023-12-15 21:32:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 995 states have (on average 1.3547738693467337) internal successors, (1348), 1003 states have internal predecessors, (1348), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-15 21:32:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1588 transitions. [2023-12-15 21:32:39,251 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1588 transitions. Word has length 116 [2023-12-15 21:32:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:39,252 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1588 transitions. [2023-12-15 21:32:39,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-15 21:32:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1588 transitions. [2023-12-15 21:32:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:39,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:39,253 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:39,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:32:39,253 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:39,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash -887658148, now seen corresponding path program 1 times [2023-12-15 21:32:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046926439] [2023-12-15 21:32:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046926439] [2023-12-15 21:32:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046926439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:39,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65757449] [2023-12-15 21:32:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:39,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:39,374 INFO L87 Difference]: Start difference. First operand 1134 states and 1588 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:39,474 INFO L93 Difference]: Finished difference Result 2425 states and 3392 transitions. [2023-12-15 21:32:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-15 21:32:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:39,478 INFO L225 Difference]: With dead ends: 2425 [2023-12-15 21:32:39,478 INFO L226 Difference]: Without dead ends: 1292 [2023-12-15 21:32:39,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:39,480 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 114 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:39,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 801 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-12-15 21:32:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1121. [2023-12-15 21:32:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 982 states have (on average 1.3523421588594704) internal successors, (1328), 990 states have internal predecessors, (1328), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-15 21:32:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1568 transitions. [2023-12-15 21:32:39,583 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1568 transitions. Word has length 116 [2023-12-15 21:32:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:39,583 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1568 transitions. [2023-12-15 21:32:39,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1568 transitions. [2023-12-15 21:32:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:39,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:39,584 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:39,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:32:39,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:39,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1988865928, now seen corresponding path program 1 times [2023-12-15 21:32:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572793193] [2023-12-15 21:32:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572793193] [2023-12-15 21:32:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572793193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273292078] [2023-12-15 21:32:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:39,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:39,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:39,741 INFO L87 Difference]: Start difference. First operand 1121 states and 1568 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:39,848 INFO L93 Difference]: Finished difference Result 2319 states and 3254 transitions. [2023-12-15 21:32:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-15 21:32:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:39,852 INFO L225 Difference]: With dead ends: 2319 [2023-12-15 21:32:39,852 INFO L226 Difference]: Without dead ends: 1199 [2023-12-15 21:32:39,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:39,854 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 126 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:39,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 594 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2023-12-15 21:32:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1103. [2023-12-15 21:32:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 964 states have (on average 1.349585062240664) internal successors, (1301), 972 states have internal predecessors, (1301), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-15 21:32:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1541 transitions. [2023-12-15 21:32:39,922 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1541 transitions. Word has length 116 [2023-12-15 21:32:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:39,922 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1541 transitions. [2023-12-15 21:32:39,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1541 transitions. [2023-12-15 21:32:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:32:39,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:39,923 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:39,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:32:39,924 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:39,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2140330353, now seen corresponding path program 1 times [2023-12-15 21:32:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:39,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044818236] [2023-12-15 21:32:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:39,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044818236] [2023-12-15 21:32:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044818236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397114576] [2023-12-15 21:32:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:40,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:40,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:40,042 INFO L87 Difference]: Start difference. First operand 1103 states and 1541 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:40,116 INFO L93 Difference]: Finished difference Result 1680 states and 2345 transitions. [2023-12-15 21:32:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-15 21:32:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:40,119 INFO L225 Difference]: With dead ends: 1680 [2023-12-15 21:32:40,119 INFO L226 Difference]: Without dead ends: 767 [2023-12-15 21:32:40,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:40,120 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 64 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:40,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 616 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2023-12-15 21:32:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2023-12-15 21:32:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 669 states have (on average 1.3423019431988041) internal successors, (898), 673 states have internal predecessors, (898), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1062 transitions. [2023-12-15 21:32:40,161 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1062 transitions. Word has length 116 [2023-12-15 21:32:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:40,162 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1062 transitions. [2023-12-15 21:32:40,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1062 transitions. [2023-12-15 21:32:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:40,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:40,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:40,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:32:40,163 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:40,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 234855303, now seen corresponding path program 1 times [2023-12-15 21:32:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227995919] [2023-12-15 21:32:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:40,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:40,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227995919] [2023-12-15 21:32:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227995919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:32:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081774576] [2023-12-15 21:32:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:40,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:32:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:32:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:32:40,753 INFO L87 Difference]: Start difference. First operand 764 states and 1062 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:41,831 INFO L93 Difference]: Finished difference Result 1600 states and 2224 transitions. [2023-12-15 21:32:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:32:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-15 21:32:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:41,835 INFO L225 Difference]: With dead ends: 1600 [2023-12-15 21:32:41,835 INFO L226 Difference]: Without dead ends: 1026 [2023-12-15 21:32:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:32:41,836 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 580 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:41,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1519 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:32:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-12-15 21:32:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 779. [2023-12-15 21:32:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 684 states have (on average 1.340643274853801) internal successors, (917), 688 states have internal predecessors, (917), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1081 transitions. [2023-12-15 21:32:41,893 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1081 transitions. Word has length 117 [2023-12-15 21:32:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:41,893 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1081 transitions. [2023-12-15 21:32:41,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:32:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1081 transitions. [2023-12-15 21:32:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:41,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:41,894 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:41,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:32:41,894 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:41,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 296894917, now seen corresponding path program 1 times [2023-12-15 21:32:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552137801] [2023-12-15 21:32:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552137801] [2023-12-15 21:32:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552137801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:32:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528676358] [2023-12-15 21:32:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:32:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:32:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:32:42,910 INFO L87 Difference]: Start difference. First operand 779 states and 1081 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-15 21:32:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:45,317 INFO L93 Difference]: Finished difference Result 1864 states and 2571 transitions. [2023-12-15 21:32:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:32:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2023-12-15 21:32:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:45,322 INFO L225 Difference]: With dead ends: 1864 [2023-12-15 21:32:45,322 INFO L226 Difference]: Without dead ends: 1275 [2023-12-15 21:32:45,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:32:45,323 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1493 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:45,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 2224 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 21:32:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2023-12-15 21:32:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 758. [2023-12-15 21:32:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 663 states have (on average 1.3408748114630467) internal successors, (889), 667 states have internal predecessors, (889), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1053 transitions. [2023-12-15 21:32:45,374 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1053 transitions. Word has length 117 [2023-12-15 21:32:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:45,374 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1053 transitions. [2023-12-15 21:32:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-15 21:32:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1053 transitions. [2023-12-15 21:32:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:45,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:45,375 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 21:32:45,375 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:45,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1786435792, now seen corresponding path program 1 times [2023-12-15 21:32:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747812703] [2023-12-15 21:32:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747812703] [2023-12-15 21:32:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747812703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:32:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733020540] [2023-12-15 21:32:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:45,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:32:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:32:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:32:45,967 INFO L87 Difference]: Start difference. First operand 758 states and 1053 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:46,384 INFO L93 Difference]: Finished difference Result 1739 states and 2399 transitions. [2023-12-15 21:32:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:32:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:32:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:46,388 INFO L225 Difference]: With dead ends: 1739 [2023-12-15 21:32:46,388 INFO L226 Difference]: Without dead ends: 982 [2023-12-15 21:32:46,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:32:46,390 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 924 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:46,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 881 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:32:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2023-12-15 21:32:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 810. [2023-12-15 21:32:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 715 states have (on average 1.3328671328671329) internal successors, (953), 719 states have internal predecessors, (953), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1117 transitions. [2023-12-15 21:32:46,438 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1117 transitions. Word has length 117 [2023-12-15 21:32:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:46,438 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 1117 transitions. [2023-12-15 21:32:46,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1117 transitions. [2023-12-15 21:32:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:46,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:46,439 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:46,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 21:32:46,439 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:46,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2115504494, now seen corresponding path program 1 times [2023-12-15 21:32:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166923099] [2023-12-15 21:32:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166923099] [2023-12-15 21:32:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166923099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:46,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-15 21:32:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168006926] [2023-12-15 21:32:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:46,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:32:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:32:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:32:46,924 INFO L87 Difference]: Start difference. First operand 810 states and 1117 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:47,426 INFO L93 Difference]: Finished difference Result 1756 states and 2425 transitions. [2023-12-15 21:32:47,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:32:47,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-15 21:32:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:47,429 INFO L225 Difference]: With dead ends: 1756 [2023-12-15 21:32:47,429 INFO L226 Difference]: Without dead ends: 947 [2023-12-15 21:32:47,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:32:47,430 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 479 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:47,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1948 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:32:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2023-12-15 21:32:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 818. [2023-12-15 21:32:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 723 states have (on average 1.3291839557399723) internal successors, (961), 727 states have internal predecessors, (961), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1125 transitions. [2023-12-15 21:32:47,479 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1125 transitions. Word has length 117 [2023-12-15 21:32:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:47,479 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1125 transitions. [2023-12-15 21:32:47,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1125 transitions. [2023-12-15 21:32:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:47,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:47,480 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:47,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 21:32:47,480 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:47,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1809068046, now seen corresponding path program 1 times [2023-12-15 21:32:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:47,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191487753] [2023-12-15 21:32:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191487753] [2023-12-15 21:32:48,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191487753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:48,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:48,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:32:48,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76208318] [2023-12-15 21:32:48,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:48,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:32:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:32:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:32:48,161 INFO L87 Difference]: Start difference. First operand 818 states and 1125 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:49,349 INFO L93 Difference]: Finished difference Result 1920 states and 2642 transitions. [2023-12-15 21:32:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:32:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:32:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:49,353 INFO L225 Difference]: With dead ends: 1920 [2023-12-15 21:32:49,353 INFO L226 Difference]: Without dead ends: 1103 [2023-12-15 21:32:49,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:32:49,354 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 680 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:49,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2132 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:32:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-12-15 21:32:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 818. [2023-12-15 21:32:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 723 states have (on average 1.3291839557399723) internal successors, (961), 727 states have internal predecessors, (961), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1125 transitions. [2023-12-15 21:32:49,406 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1125 transitions. Word has length 117 [2023-12-15 21:32:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:49,406 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1125 transitions. [2023-12-15 21:32:49,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1125 transitions. [2023-12-15 21:32:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:32:49,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:49,407 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 21:32:49,408 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:49,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2092872240, now seen corresponding path program 1 times [2023-12-15 21:32:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035863156] [2023-12-15 21:32:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035863156] [2023-12-15 21:32:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035863156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:32:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707253846] [2023-12-15 21:32:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:49,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:32:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:32:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:32:49,692 INFO L87 Difference]: Start difference. First operand 818 states and 1125 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:49,942 INFO L93 Difference]: Finished difference Result 1946 states and 2676 transitions. [2023-12-15 21:32:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:32:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:32:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:49,945 INFO L225 Difference]: With dead ends: 1946 [2023-12-15 21:32:49,945 INFO L226 Difference]: Without dead ends: 1129 [2023-12-15 21:32:49,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:32:49,947 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 307 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:49,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 808 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:32:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-12-15 21:32:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 895. [2023-12-15 21:32:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 800 states have (on average 1.32) internal successors, (1056), 804 states have internal predecessors, (1056), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1220 transitions. [2023-12-15 21:32:50,003 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1220 transitions. Word has length 117 [2023-12-15 21:32:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:50,003 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1220 transitions. [2023-12-15 21:32:50,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1220 transitions. [2023-12-15 21:32:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:32:50,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:50,004 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:50,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 21:32:50,004 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:50,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash 187748851, now seen corresponding path program 1 times [2023-12-15 21:32:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593286175] [2023-12-15 21:32:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593286175] [2023-12-15 21:32:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593286175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:32:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916903772] [2023-12-15 21:32:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:52,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:32:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:32:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:32:52,197 INFO L87 Difference]: Start difference. First operand 895 states and 1220 transitions. Second operand has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:53,562 INFO L93 Difference]: Finished difference Result 1776 states and 2427 transitions. [2023-12-15 21:32:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-15 21:32:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2023-12-15 21:32:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:53,566 INFO L225 Difference]: With dead ends: 1776 [2023-12-15 21:32:53,566 INFO L226 Difference]: Without dead ends: 1123 [2023-12-15 21:32:53,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2023-12-15 21:32:53,568 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 924 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:53,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2023 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:32:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2023-12-15 21:32:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 904. [2023-12-15 21:32:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 809 states have (on average 1.3164400494437578) internal successors, (1065), 813 states have internal predecessors, (1065), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1229 transitions. [2023-12-15 21:32:53,624 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1229 transitions. Word has length 119 [2023-12-15 21:32:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:53,624 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 1229 transitions. [2023-12-15 21:32:53,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:32:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1229 transitions. [2023-12-15 21:32:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:32:53,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:53,625 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:53,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 21:32:53,625 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:53,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash 339213276, now seen corresponding path program 1 times [2023-12-15 21:32:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:53,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652969036] [2023-12-15 21:32:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652969036] [2023-12-15 21:32:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652969036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396188011] [2023-12-15 21:32:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:53,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:53,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:53,751 INFO L87 Difference]: Start difference. First operand 904 states and 1229 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:53,840 INFO L93 Difference]: Finished difference Result 1554 states and 2116 transitions. [2023-12-15 21:32:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:32:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-15 21:32:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:53,849 INFO L225 Difference]: With dead ends: 1554 [2023-12-15 21:32:53,849 INFO L226 Difference]: Without dead ends: 892 [2023-12-15 21:32:53,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:53,851 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 67 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:53,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 655 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-15 21:32:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2023-12-15 21:32:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 794 states have (on average 1.3110831234256928) internal successors, (1041), 798 states have internal predecessors, (1041), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1205 transitions. [2023-12-15 21:32:53,914 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1205 transitions. Word has length 119 [2023-12-15 21:32:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:53,914 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1205 transitions. [2023-12-15 21:32:53,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1205 transitions. [2023-12-15 21:32:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:32:53,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:53,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 21:32:53,916 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:53,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1257912736, now seen corresponding path program 1 times [2023-12-15 21:32:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967786468] [2023-12-15 21:32:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967786468] [2023-12-15 21:32:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967786468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:54,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:54,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921464501] [2023-12-15 21:32:54,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:54,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:54,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:54,015 INFO L87 Difference]: Start difference. First operand 889 states and 1205 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:54,093 INFO L93 Difference]: Finished difference Result 1857 states and 2521 transitions. [2023-12-15 21:32:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:54,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-15 21:32:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:54,096 INFO L225 Difference]: With dead ends: 1857 [2023-12-15 21:32:54,096 INFO L226 Difference]: Without dead ends: 969 [2023-12-15 21:32:54,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:32:54,098 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:54,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2023-12-15 21:32:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 913. [2023-12-15 21:32:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 818 states have (on average 1.3019559902200488) internal successors, (1065), 822 states have internal predecessors, (1065), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1229 transitions. [2023-12-15 21:32:54,155 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1229 transitions. Word has length 119 [2023-12-15 21:32:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:54,156 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1229 transitions. [2023-12-15 21:32:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1229 transitions. [2023-12-15 21:32:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:32:54,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:54,157 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:54,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 21:32:54,157 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:54,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 918807579, now seen corresponding path program 1 times [2023-12-15 21:32:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14644894] [2023-12-15 21:32:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14644894] [2023-12-15 21:32:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14644894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:32:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:32:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:32:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543020940] [2023-12-15 21:32:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:54,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:32:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:32:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:32:54,284 INFO L87 Difference]: Start difference. First operand 913 states and 1229 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:32:54,399 INFO L93 Difference]: Finished difference Result 1851 states and 2493 transitions. [2023-12-15 21:32:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:32:54,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-12-15 21:32:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:32:54,401 INFO L225 Difference]: With dead ends: 1851 [2023-12-15 21:32:54,401 INFO L226 Difference]: Without dead ends: 939 [2023-12-15 21:32:54,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:32:54,402 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 75 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:32:54,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 560 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:32:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-12-15 21:32:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 894. [2023-12-15 21:32:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 799 states have (on average 1.2941176470588236) internal successors, (1034), 803 states have internal predecessors, (1034), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:32:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1198 transitions. [2023-12-15 21:32:54,457 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1198 transitions. Word has length 121 [2023-12-15 21:32:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:32:54,458 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1198 transitions. [2023-12-15 21:32:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:32:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1198 transitions. [2023-12-15 21:32:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:32:54,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:32:54,459 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:32:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 21:32:54,459 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:32:54,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:32:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -276945156, now seen corresponding path program 1 times [2023-12-15 21:32:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:32:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12627347] [2023-12-15 21:32:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:32:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:32:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:32:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:32:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:32:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:32:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:32:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:32:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:32:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:32:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:32:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:32:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:32:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-15 21:32:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:32:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12627347] [2023-12-15 21:32:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12627347] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:32:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825035019] [2023-12-15 21:32:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:32:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:32:55,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:32:55,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:32:55,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:32:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:32:56,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-15 21:32:56,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:32:56,869 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-15 21:32:57,086 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 0 case distinctions, treesize of input 96 treesize of output 83 [2023-12-15 21:32:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 23 [2023-12-15 21:32:57,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2023-12-15 21:32:57,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2023-12-15 21:32:57,554 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 89 treesize of output 69 [2023-12-15 21:32:57,569 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 73 treesize of output 61 [2023-12-15 21:32:57,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:57,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 50 [2023-12-15 21:32:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-15 21:32:58,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:32:58,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-15 21:32:58,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:32:58,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 57 [2023-12-15 21:32:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 55 [2023-12-15 21:32:58,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-12-15 21:32:59,310 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 250 treesize of output 218 [2023-12-15 21:32:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:32:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825035019] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:32:59,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:32:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23, 14] total 40 [2023-12-15 21:32:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399444584] [2023-12-15 21:32:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:32:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:32:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:32:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:32:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2023-12-15 21:32:59,508 INFO L87 Difference]: Start difference. First operand 894 states and 1198 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:33:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:33:01,084 INFO L93 Difference]: Finished difference Result 1897 states and 2558 transitions. [2023-12-15 21:33:01,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-15 21:33:01,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-15 21:33:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:33:01,086 INFO L225 Difference]: With dead ends: 1897 [2023-12-15 21:33:01,086 INFO L226 Difference]: Without dead ends: 1241 [2023-12-15 21:33:01,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 251 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=307, Invalid=2773, Unknown=0, NotChecked=0, Total=3080 [2023-12-15 21:33:01,088 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 607 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:33:01,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1733 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:33:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2023-12-15 21:33:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 957. [2023-12-15 21:33:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 862 states have (on average 1.291183294663573) internal successors, (1113), 866 states have internal predecessors, (1113), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:33:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1277 transitions. [2023-12-15 21:33:01,194 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1277 transitions. Word has length 123 [2023-12-15 21:33:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:33:01,194 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1277 transitions. [2023-12-15 21:33:01,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:33:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1277 transitions. [2023-12-15 21:33:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:33:01,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:33:01,196 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:33:01,204 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-15 21:33:01,403 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,SelfDestructingSolverStorable33 [2023-12-15 21:33:01,403 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:33:01,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:33:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1086291782, now seen corresponding path program 1 times [2023-12-15 21:33:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:33:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85222953] [2023-12-15 21:33:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:33:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:33:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:33:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:33:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:33:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:33:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:33:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:33:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:33:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:33:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:33:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:33:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:33:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:33:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:33:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:33:01,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85222953] [2023-12-15 21:33:01,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85222953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:33:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:33:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:33:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270333948] [2023-12-15 21:33:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:33:01,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:33:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:33:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:33:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:33:01,701 INFO L87 Difference]: Start difference. First operand 957 states and 1277 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:33:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:33:01,983 INFO L93 Difference]: Finished difference Result 1841 states and 2469 transitions. [2023-12-15 21:33:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:33:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2023-12-15 21:33:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:33:01,985 INFO L225 Difference]: With dead ends: 1841 [2023-12-15 21:33:01,985 INFO L226 Difference]: Without dead ends: 1122 [2023-12-15 21:33:01,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:33:01,986 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 357 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:33:01,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 902 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:33:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2023-12-15 21:33:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 957. [2023-12-15 21:33:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 862 states have (on average 1.288863109048724) internal successors, (1111), 866 states have internal predecessors, (1111), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-15 21:33:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1275 transitions. [2023-12-15 21:33:02,059 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1275 transitions. Word has length 123 [2023-12-15 21:33:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:33:02,059 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1275 transitions. [2023-12-15 21:33:02,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:33:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1275 transitions. [2023-12-15 21:33:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:33:02,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:33:02,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:33:02,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 21:33:02,063 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:33:02,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:33:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2185542, now seen corresponding path program 1 times [2023-12-15 21:33:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:33:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817178990] [2023-12-15 21:33:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:33:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:33:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:33:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:33:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:33:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:33:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:33:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:33:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:33:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:33:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:33:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:33:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:33:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:33:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:33:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:33:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817178990] [2023-12-15 21:33:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817178990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:33:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:33:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:33:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806177209] [2023-12-15 21:33:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:33:02,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:33:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:33:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:33:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:33:02,353 INFO L87 Difference]: Start difference. First operand 957 states and 1275 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:33:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:33:02,645 INFO L93 Difference]: Finished difference Result 1856 states and 2489 transitions. [2023-12-15 21:33:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:33:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2023-12-15 21:33:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:33:02,647 INFO L225 Difference]: With dead ends: 1856 [2023-12-15 21:33:02,647 INFO L226 Difference]: Without dead ends: 1137 [2023-12-15 21:33:02,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:33:02,649 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 480 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:33:02,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 825 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:33:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-12-15 21:33:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 802. [2023-12-15 21:33:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 727 states have (on average 1.2874828060522696) internal successors, (936), 729 states have internal predecessors, (936), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 21:33:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1064 transitions. [2023-12-15 21:33:02,705 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1064 transitions. Word has length 123 [2023-12-15 21:33:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:33:02,705 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1064 transitions. [2023-12-15 21:33:02,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:33:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1064 transitions. [2023-12-15 21:33:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:33:02,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:33:02,707 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:33:02,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-15 21:33:02,707 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:33:02,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:33:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -811532168, now seen corresponding path program 1 times [2023-12-15 21:33:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:33:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778977679] [2023-12-15 21:33:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:33:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:33:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:33:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:33:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:33:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:33:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:33:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:33:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:33:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:33:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:33:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:33:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:33:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:33:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-15 21:33:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:33:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778977679] [2023-12-15 21:33:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778977679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:33:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320206653] [2023-12-15 21:33:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:33:04,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:33:04,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:33:04,299 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:33:04,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:33:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:33:04,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-15 21:33:04,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:33:06,423 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-15 21:33:07,000 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-15 21:33:07,998 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-12-15 21:33:07,998 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 36 treesize of output 31 [2023-12-15 21:33:08,353 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-15 21:33:08,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 100 [2023-12-15 21:33:08,498 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-15 21:33:08,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 117 [2023-12-15 21:33:08,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 30 treesize of output 15 [2023-12-15 21:33:08,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2023-12-15 21:33:09,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:33:09,230 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 68 treesize of output 52 [2023-12-15 21:33:09,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-15 21:33:09,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:33:09,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2023-12-15 21:33:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 140 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:33:09,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:33:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320206653] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:33:10,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:33:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31] total 50 [2023-12-15 21:33:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508616135] [2023-12-15 21:33:10,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:33:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-15 21:33:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:33:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-15 21:33:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2938, Unknown=0, NotChecked=0, Total=3192 [2023-12-15 21:33:10,921 INFO L87 Difference]: Start difference. First operand 802 states and 1064 transitions. Second operand has 50 states, 46 states have (on average 3.152173913043478) internal successors, (145), 45 states have internal predecessors, (145), 10 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Received shutdown request... [2023-12-15 21:33:18,149 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:33:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-15 21:33:18,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 148 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=968, Invalid=7042, Unknown=0, NotChecked=0, Total=8010 [2023-12-15 21:33:18,152 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1037 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:33:18,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 3050 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-15 21:33:18,153 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:33:18,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:33:18,182 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:33:18,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-15 21:33:18,355 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (802states) and FLOYD_HOARE automaton (currently 35 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. [2023-12-15 21:33:18,358 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:33:18,359 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:33:18,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:33:18 BoogieIcfgContainer [2023-12-15 21:33:18,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:33:18,361 INFO L158 Benchmark]: Toolchain (without parser) took 52398.58ms. Allocated memory was 297.8MB in the beginning and 886.0MB in the end (delta: 588.3MB). Free memory was 248.0MB in the beginning and 403.7MB in the end (delta: -155.8MB). Peak memory consumption was 433.5MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 162.2MB in the beginning and 162.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.90ms. Allocated memory is still 297.8MB. Free memory was 248.0MB in the beginning and 233.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.18ms. Allocated memory is still 297.8MB. Free memory was 233.3MB in the beginning and 229.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: Boogie Preprocessor took 52.17ms. Allocated memory is still 297.8MB. Free memory was 229.8MB in the beginning and 225.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: RCFGBuilder took 517.92ms. Allocated memory is still 297.8MB. Free memory was 225.0MB in the beginning and 238.0MB in the end (delta: -13.0MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,361 INFO L158 Benchmark]: TraceAbstraction took 51493.75ms. Allocated memory was 297.8MB in the beginning and 886.0MB in the end (delta: 588.3MB). Free memory was 237.4MB in the beginning and 403.7MB in the end (delta: -166.3MB). Peak memory consumption was 421.4MB. Max. memory is 8.0GB. [2023-12-15 21:33:18,362 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.10ms. Allocated memory is still 213.9MB. Free memory was 162.2MB in the beginning and 162.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.90ms. Allocated memory is still 297.8MB. Free memory was 248.0MB in the beginning and 233.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.18ms. Allocated memory is still 297.8MB. Free memory was 233.3MB in the beginning and 229.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.17ms. Allocated memory is still 297.8MB. Free memory was 229.8MB in the beginning and 225.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 517.92ms. Allocated memory is still 297.8MB. Free memory was 225.0MB in the beginning and 238.0MB in the end (delta: -13.0MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. * TraceAbstraction took 51493.75ms. Allocated memory was 297.8MB in the beginning and 886.0MB in the end (delta: 588.3MB). Free memory was 237.4MB in the beginning and 403.7MB in the end (delta: -166.3MB). Peak memory consumption was 421.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (802states) and FLOYD_HOARE automaton (currently 35 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.5s, OverallIterations: 37, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13836 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13835 mSDsluCounter, 39230 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31993 mSDsCounter, 1410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11772 IncrementalHoareTripleChecker+Invalid, 13182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1410 mSolverCounterUnsat, 7237 mSDtfsCounter, 11772 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1860 GetRequests, 1335 SyntacticMatches, 7 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1320occurred in iteration=19, InterpolantAutomatonStates: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 6236 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 4526 NumberOfCodeBlocks, 4526 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4609 ConstructedInterpolants, 91 QuantifiedInterpolants, 46158 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 40 InterpolantComputations, 36 PerfectInterpolantSequences, 10259/10560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown