/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:29:41,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:29:41,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:29:41,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:29:41,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:29:41,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:29:41,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:29:41,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:29:41,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:29:41,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:29:41,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:29:41,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:29:41,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:29:41,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:29:41,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:29:41,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:29:41,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:29:41,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:29:41,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:29:41,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:29:41,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:29:41,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:29:41,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:29:41,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:29:41,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:29:41,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:29:41,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:29:41,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:29:41,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:29:41,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:29:41,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:29:41,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:29:41,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:29:41,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:29:41,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:29:41,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:29:41,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:29:41,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:29:41,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:29:41,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:29:41,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:29:41,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:29:41,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:29:41,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:29:41,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:29:41,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:29:41,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:29:41,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:29:41,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:29:41,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:29:41,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:29:41,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:29:41,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:29:41,353 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:29:41,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:29:41,353 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:29:41,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:29:41,354 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:29:41,354 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:29:41,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:29:41,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:29:41,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:29:41,622 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:29:41,626 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:29:41,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-11 03:29:41,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd89aeff/dd345a4e0837456481840e6940715caf/FLAG868914d8c [2022-01-11 03:29:42,208 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:29:42,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-11 03:29:42,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd89aeff/dd345a4e0837456481840e6940715caf/FLAG868914d8c [2022-01-11 03:29:42,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd89aeff/dd345a4e0837456481840e6940715caf [2022-01-11 03:29:42,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:29:42,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:29:42,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:29:42,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:29:42,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:29:42,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:29:42" (1/1) ... [2022-01-11 03:29:42,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f0c5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:42, skipping insertion in model container [2022-01-11 03:29:42,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:29:42" (1/1) ... [2022-01-11 03:29:42,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:29:42,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:29:42,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-01-11 03:29:42,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:29:42,896 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:29:42,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-01-11 03:29:42,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:29:43,012 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:29:43,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43 WrapperNode [2022-01-11 03:29:43,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:29:43,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:29:43,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:29:43,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:29:43,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,123 INFO L137 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 71, calls inlined = 137, statements flattened = 2437 [2022-01-11 03:29:43,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:29:43,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:29:43,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:29:43,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:29:43,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:29:43,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:29:43,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:29:43,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:29:43,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (1/1) ... [2022-01-11 03:29:43,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:29:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:29:43,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:29:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:29:43,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:29:43,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:29:43,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:29:43,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:29:43,486 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:29:43,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:29:43,494 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,506 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,510 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,534 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,535 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,536 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,542 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,565 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,570 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,573 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,575 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,578 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,587 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,591 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,593 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,594 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,599 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,617 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,618 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,619 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,622 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,626 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,653 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,657 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,658 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,661 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,662 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,667 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,668 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:43,669 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:29:44,725 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2022-01-11 03:29:44,725 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2022-01-11 03:29:44,725 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2022-01-11 03:29:44,725 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2022-01-11 03:29:44,726 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2022-01-11 03:29:44,727 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-01-11 03:29:44,728 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2022-01-11 03:29:44,729 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2022-01-11 03:29:44,730 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2022-01-11 03:29:44,730 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2022-01-11 03:29:44,730 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2022-01-11 03:29:44,730 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2022-01-11 03:29:44,731 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2022-01-11 03:29:44,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2022-01-11 03:29:44,733 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2022-01-11 03:29:44,734 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2022-01-11 03:29:44,734 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2022-01-11 03:29:44,734 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-01-11 03:29:44,734 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-01-11 03:29:44,734 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:29:44,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:29:44,752 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:29:44,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:29:44 BoogieIcfgContainer [2022-01-11 03:29:44,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:29:44,756 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:29:44,756 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:29:44,760 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:29:44,763 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:29:44" (1/1) ... [2022-01-11 03:29:45,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:29:45 BasicIcfg [2022-01-11 03:29:45,223 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:29:45,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:29:45,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:29:45,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:29:45,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:29:42" (1/4) ... [2022-01-11 03:29:45,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e247d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:29:45, skipping insertion in model container [2022-01-11 03:29:45,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:29:43" (2/4) ... [2022-01-11 03:29:45,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e247d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:29:45, skipping insertion in model container [2022-01-11 03:29:45,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:29:44" (3/4) ... [2022-01-11 03:29:45,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e247d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:29:45, skipping insertion in model container [2022-01-11 03:29:45,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:29:45" (4/4) ... [2022-01-11 03:29:45,231 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cTransformedIcfg [2022-01-11 03:29:45,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:29:45,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2022-01-11 03:29:45,290 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:29:45,300 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:29:45,301 INFO L340 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-01-11 03:29:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 639 states, 585 states have (on average 1.5316239316239317) internal successors, (896), 638 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 03:29:45,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:45,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:45,332 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1448027614, now seen corresponding path program 1 times [2022-01-11 03:29:45,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:45,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5394009] [2022-01-11 03:29:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:45,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:45,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:45,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5394009] [2022-01-11 03:29:45,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5394009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:45,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:45,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:45,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224779126] [2022-01-11 03:29:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:45,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:45,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:45,660 INFO L87 Difference]: Start difference. First operand has 639 states, 585 states have (on average 1.5316239316239317) internal successors, (896), 638 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:46,055 INFO L93 Difference]: Finished difference Result 1213 states and 1703 transitions. [2022-01-11 03:29:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:46,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-11 03:29:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:46,071 INFO L225 Difference]: With dead ends: 1213 [2022-01-11 03:29:46,071 INFO L226 Difference]: Without dead ends: 702 [2022-01-11 03:29:46,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,078 INFO L933 BasicCegarLoop]: 863 mSDtfsCounter, 434 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:46,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1214 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:29:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-01-11 03:29:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 679. [2022-01-11 03:29:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 645 states have (on average 1.4232558139534883) internal successors, (918), 678 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 918 transitions. [2022-01-11 03:29:46,203 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 918 transitions. Word has length 12 [2022-01-11 03:29:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:46,205 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 918 transitions. [2022-01-11 03:29:46,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 918 transitions. [2022-01-11 03:29:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 03:29:46,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:46,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:46,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:29:46,206 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash -54459679, now seen corresponding path program 1 times [2022-01-11 03:29:46,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:46,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427294328] [2022-01-11 03:29:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:46,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:46,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:46,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427294328] [2022-01-11 03:29:46,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427294328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:46,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:46,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:46,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097501348] [2022-01-11 03:29:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:46,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:46,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,262 INFO L87 Difference]: Start difference. First operand 679 states and 918 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:46,448 INFO L93 Difference]: Finished difference Result 698 states and 940 transitions. [2022-01-11 03:29:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-11 03:29:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:46,451 INFO L225 Difference]: With dead ends: 698 [2022-01-11 03:29:46,452 INFO L226 Difference]: Without dead ends: 679 [2022-01-11 03:29:46,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,459 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 4 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:46,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1298 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-11 03:29:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-01-11 03:29:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 645 states have (on average 1.4217054263565891) internal successors, (917), 678 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 917 transitions. [2022-01-11 03:29:46,497 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 917 transitions. Word has length 12 [2022-01-11 03:29:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:46,498 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 917 transitions. [2022-01-11 03:29:46,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 917 transitions. [2022-01-11 03:29:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 03:29:46,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:46,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:46,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:29:46,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1995239899, now seen corresponding path program 1 times [2022-01-11 03:29:46,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824026541] [2022-01-11 03:29:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:46,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:46,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:46,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824026541] [2022-01-11 03:29:46,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824026541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:46,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:46,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:46,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941736088] [2022-01-11 03:29:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:46,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:46,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,568 INFO L87 Difference]: Start difference. First operand 679 states and 917 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:46,607 INFO L93 Difference]: Finished difference Result 775 states and 1034 transitions. [2022-01-11 03:29:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:46,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 03:29:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:46,610 INFO L225 Difference]: With dead ends: 775 [2022-01-11 03:29:46,610 INFO L226 Difference]: Without dead ends: 751 [2022-01-11 03:29:46,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,617 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 704 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:46,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 813 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-01-11 03:29:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 696. [2022-01-11 03:29:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 665 states have (on average 1.4255639097744361) internal successors, (948), 695 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 948 transitions. [2022-01-11 03:29:46,651 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 948 transitions. Word has length 18 [2022-01-11 03:29:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:46,654 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 948 transitions. [2022-01-11 03:29:46,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 948 transitions. [2022-01-11 03:29:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:29:46,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:46,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:46,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:29:46,658 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:46,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -525905178, now seen corresponding path program 1 times [2022-01-11 03:29:46,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612604597] [2022-01-11 03:29:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:46,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:46,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:46,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612604597] [2022-01-11 03:29:46,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612604597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:46,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:46,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:46,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506779734] [2022-01-11 03:29:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:46,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:46,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,753 INFO L87 Difference]: Start difference. First operand 696 states and 948 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:46,940 INFO L93 Difference]: Finished difference Result 724 states and 982 transitions. [2022-01-11 03:29:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:46,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-11 03:29:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:46,944 INFO L225 Difference]: With dead ends: 724 [2022-01-11 03:29:46,944 INFO L226 Difference]: Without dead ends: 719 [2022-01-11 03:29:46,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:46,950 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 33 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:46,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 1267 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-01-11 03:29:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2022-01-11 03:29:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 688 states have (on average 1.4200581395348837) internal successors, (977), 718 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 977 transitions. [2022-01-11 03:29:46,987 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 977 transitions. Word has length 21 [2022-01-11 03:29:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:46,987 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 977 transitions. [2022-01-11 03:29:46,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 977 transitions. [2022-01-11 03:29:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:29:46,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:46,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:46,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:29:46,993 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash -362481359, now seen corresponding path program 1 times [2022-01-11 03:29:46,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:46,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037918842] [2022-01-11 03:29:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:46,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:47,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:47,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037918842] [2022-01-11 03:29:47,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037918842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:47,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:47,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:47,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706352095] [2022-01-11 03:29:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:47,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:47,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:47,076 INFO L87 Difference]: Start difference. First operand 719 states and 977 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:47,144 INFO L93 Difference]: Finished difference Result 1226 states and 1657 transitions. [2022-01-11 03:29:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-11 03:29:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:47,148 INFO L225 Difference]: With dead ends: 1226 [2022-01-11 03:29:47,148 INFO L226 Difference]: Without dead ends: 854 [2022-01-11 03:29:47,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:47,150 INFO L933 BasicCegarLoop]: 641 mSDtfsCounter, 590 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:47,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 850 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-01-11 03:29:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 692. [2022-01-11 03:29:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 671 states have (on average 1.406855439642325) internal successors, (944), 691 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 944 transitions. [2022-01-11 03:29:47,177 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 944 transitions. Word has length 21 [2022-01-11 03:29:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:47,177 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 944 transitions. [2022-01-11 03:29:47,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 944 transitions. [2022-01-11 03:29:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:29:47,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:47,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:47,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:29:47,179 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 877827723, now seen corresponding path program 1 times [2022-01-11 03:29:47,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:47,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132980075] [2022-01-11 03:29:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:47,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:47,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:47,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132980075] [2022-01-11 03:29:47,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132980075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:47,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:47,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:47,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111337456] [2022-01-11 03:29:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:47,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:47,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:47,247 INFO L87 Difference]: Start difference. First operand 692 states and 944 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:47,294 INFO L93 Difference]: Finished difference Result 704 states and 957 transitions. [2022-01-11 03:29:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:47,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-11 03:29:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:47,297 INFO L225 Difference]: With dead ends: 704 [2022-01-11 03:29:47,297 INFO L226 Difference]: Without dead ends: 684 [2022-01-11 03:29:47,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:47,299 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 639 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:47,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 1311 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-01-11 03:29:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-01-11 03:29:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 663 states have (on average 1.4087481146304677) internal successors, (934), 683 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 934 transitions. [2022-01-11 03:29:47,334 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 934 transitions. Word has length 22 [2022-01-11 03:29:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:47,334 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 934 transitions. [2022-01-11 03:29:47,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 934 transitions. [2022-01-11 03:29:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 03:29:47,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:47,335 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:47,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:29:47,335 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash 210648265, now seen corresponding path program 1 times [2022-01-11 03:29:47,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:47,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957355908] [2022-01-11 03:29:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:47,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:47,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957355908] [2022-01-11 03:29:47,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957355908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:47,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:47,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:47,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701987448] [2022-01-11 03:29:47,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:47,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:47,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:47,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:47,401 INFO L87 Difference]: Start difference. First operand 684 states and 934 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:47,579 INFO L93 Difference]: Finished difference Result 684 states and 934 transitions. [2022-01-11 03:29:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-11 03:29:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:47,582 INFO L225 Difference]: With dead ends: 684 [2022-01-11 03:29:47,583 INFO L226 Difference]: Without dead ends: 668 [2022-01-11 03:29:47,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:47,584 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 97 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:47,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 990 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-01-11 03:29:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2022-01-11 03:29:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 655 states have (on average 1.4) internal successors, (917), 667 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 917 transitions. [2022-01-11 03:29:47,621 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 917 transitions. Word has length 25 [2022-01-11 03:29:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:47,621 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 917 transitions. [2022-01-11 03:29:47,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 917 transitions. [2022-01-11 03:29:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 03:29:47,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:47,622 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:47,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:29:47,623 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash -723765965, now seen corresponding path program 1 times [2022-01-11 03:29:47,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:47,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853373122] [2022-01-11 03:29:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:47,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:47,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:47,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853373122] [2022-01-11 03:29:47,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853373122] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:47,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:47,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:47,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817431160] [2022-01-11 03:29:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:47,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:47,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:47,678 INFO L87 Difference]: Start difference. First operand 668 states and 917 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:47,733 INFO L93 Difference]: Finished difference Result 681 states and 931 transitions. [2022-01-11 03:29:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 03:29:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:47,737 INFO L225 Difference]: With dead ends: 681 [2022-01-11 03:29:47,738 INFO L226 Difference]: Without dead ends: 666 [2022-01-11 03:29:47,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:47,739 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 16 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:47,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1861 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-11 03:29:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2022-01-11 03:29:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 653 states have (on average 1.3996937212863707) internal successors, (914), 665 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 914 transitions. [2022-01-11 03:29:47,772 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 914 transitions. Word has length 26 [2022-01-11 03:29:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:47,773 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 914 transitions. [2022-01-11 03:29:47,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 914 transitions. [2022-01-11 03:29:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 03:29:47,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:47,775 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:47,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:29:47,775 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1512514622, now seen corresponding path program 1 times [2022-01-11 03:29:47,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:47,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942151318] [2022-01-11 03:29:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:47,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:47,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942151318] [2022-01-11 03:29:47,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942151318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:47,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:47,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:47,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647567095] [2022-01-11 03:29:47,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:47,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:47,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:47,834 INFO L87 Difference]: Start difference. First operand 666 states and 914 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,023 INFO L93 Difference]: Finished difference Result 865 states and 1180 transitions. [2022-01-11 03:29:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 03:29:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,026 INFO L225 Difference]: With dead ends: 865 [2022-01-11 03:29:48,026 INFO L226 Difference]: Without dead ends: 857 [2022-01-11 03:29:48,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:48,029 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 128 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:48,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 1205 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-01-11 03:29:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 684. [2022-01-11 03:29:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 671 states have (on average 1.4023845007451565) internal successors, (941), 683 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 941 transitions. [2022-01-11 03:29:48,060 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 941 transitions. Word has length 27 [2022-01-11 03:29:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,060 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 941 transitions. [2022-01-11 03:29:48,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 941 transitions. [2022-01-11 03:29:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 03:29:48,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,062 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:29:48,063 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 355662828, now seen corresponding path program 1 times [2022-01-11 03:29:48,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12353347] [2022-01-11 03:29:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12353347] [2022-01-11 03:29:48,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12353347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:48,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183852700] [2022-01-11 03:29:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:48,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:48,129 INFO L87 Difference]: Start difference. First operand 684 states and 941 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,193 INFO L93 Difference]: Finished difference Result 792 states and 1069 transitions. [2022-01-11 03:29:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-11 03:29:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,196 INFO L225 Difference]: With dead ends: 792 [2022-01-11 03:29:48,196 INFO L226 Difference]: Without dead ends: 739 [2022-01-11 03:29:48,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:48,197 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 56 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:48,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 1913 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-01-11 03:29:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 686. [2022-01-11 03:29:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 673 states have (on average 1.401188707280832) internal successors, (943), 685 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 943 transitions. [2022-01-11 03:29:48,228 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 943 transitions. Word has length 28 [2022-01-11 03:29:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,228 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 943 transitions. [2022-01-11 03:29:48,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 943 transitions. [2022-01-11 03:29:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 03:29:48,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,229 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:29:48,229 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 969274777, now seen corresponding path program 1 times [2022-01-11 03:29:48,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974446053] [2022-01-11 03:29:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974446053] [2022-01-11 03:29:48,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974446053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:48,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352392303] [2022-01-11 03:29:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:48,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:48,273 INFO L87 Difference]: Start difference. First operand 686 states and 943 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,322 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2022-01-11 03:29:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-11 03:29:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,325 INFO L225 Difference]: With dead ends: 699 [2022-01-11 03:29:48,325 INFO L226 Difference]: Without dead ends: 684 [2022-01-11 03:29:48,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:48,326 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 16 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1854 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 [2022-01-11 03:29:48,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1854 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-01-11 03:29:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-01-11 03:29:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 671 states have (on average 1.4008941877794336) internal successors, (940), 683 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 940 transitions. [2022-01-11 03:29:48,357 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 940 transitions. Word has length 28 [2022-01-11 03:29:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,357 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 940 transitions. [2022-01-11 03:29:48,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 940 transitions. [2022-01-11 03:29:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 03:29:48,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,358 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:29:48,359 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1648243224, now seen corresponding path program 1 times [2022-01-11 03:29:48,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656665370] [2022-01-11 03:29:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656665370] [2022-01-11 03:29:48,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656665370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:48,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994011937] [2022-01-11 03:29:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:48,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:48,396 INFO L87 Difference]: Start difference. First operand 684 states and 940 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,437 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2022-01-11 03:29:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:48,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-11 03:29:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,440 INFO L225 Difference]: With dead ends: 726 [2022-01-11 03:29:48,440 INFO L226 Difference]: Without dead ends: 661 [2022-01-11 03:29:48,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:48,441 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 70 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:48,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 1246 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-01-11 03:29:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2022-01-11 03:29:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 644 states have (on average 1.3990683229813665) internal successors, (901), 656 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 901 transitions. [2022-01-11 03:29:48,471 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 901 transitions. Word has length 29 [2022-01-11 03:29:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,471 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 901 transitions. [2022-01-11 03:29:48,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 901 transitions. [2022-01-11 03:29:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 03:29:48,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,472 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:29:48,473 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1613577908, now seen corresponding path program 1 times [2022-01-11 03:29:48,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869771932] [2022-01-11 03:29:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869771932] [2022-01-11 03:29:48,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869771932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:48,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331071253] [2022-01-11 03:29:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:48,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:48,515 INFO L87 Difference]: Start difference. First operand 657 states and 901 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,600 INFO L93 Difference]: Finished difference Result 696 states and 943 transitions. [2022-01-11 03:29:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:48,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-11 03:29:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,603 INFO L225 Difference]: With dead ends: 696 [2022-01-11 03:29:48,603 INFO L226 Difference]: Without dead ends: 675 [2022-01-11 03:29:48,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:48,604 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 37 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:48,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1824 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-11 03:29:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 659. [2022-01-11 03:29:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 646 states have (on average 1.3978328173374612) internal successors, (903), 658 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 903 transitions. [2022-01-11 03:29:48,632 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 903 transitions. Word has length 29 [2022-01-11 03:29:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,633 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 903 transitions. [2022-01-11 03:29:48,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 903 transitions. [2022-01-11 03:29:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:29:48,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,634 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:29:48,634 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -515082759, now seen corresponding path program 1 times [2022-01-11 03:29:48,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942582768] [2022-01-11 03:29:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942582768] [2022-01-11 03:29:48,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942582768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:48,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719442918] [2022-01-11 03:29:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:48,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:48,680 INFO L87 Difference]: Start difference. First operand 659 states and 903 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:48,745 INFO L93 Difference]: Finished difference Result 698 states and 945 transitions. [2022-01-11 03:29:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 03:29:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:48,748 INFO L225 Difference]: With dead ends: 698 [2022-01-11 03:29:48,748 INFO L226 Difference]: Without dead ends: 677 [2022-01-11 03:29:48,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:48,749 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 37 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:48,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1824 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-01-11 03:29:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 659. [2022-01-11 03:29:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 646 states have (on average 1.3978328173374612) internal successors, (903), 658 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 903 transitions. [2022-01-11 03:29:48,787 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 903 transitions. Word has length 30 [2022-01-11 03:29:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:48,787 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 903 transitions. [2022-01-11 03:29:48,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 903 transitions. [2022-01-11 03:29:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:29:48,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:48,789 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:48,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:29:48,789 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash -808485766, now seen corresponding path program 1 times [2022-01-11 03:29:48,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193682678] [2022-01-11 03:29:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:48,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:48,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193682678] [2022-01-11 03:29:48,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193682678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:48,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:48,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:48,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067352581] [2022-01-11 03:29:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:48,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:48,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:48,911 INFO L87 Difference]: Start difference. First operand 659 states and 903 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:49,020 INFO L93 Difference]: Finished difference Result 698 states and 945 transitions. [2022-01-11 03:29:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 03:29:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:49,023 INFO L225 Difference]: With dead ends: 698 [2022-01-11 03:29:49,023 INFO L226 Difference]: Without dead ends: 677 [2022-01-11 03:29:49,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:49,024 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 38 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:49,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1802 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-01-11 03:29:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 659. [2022-01-11 03:29:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 646 states have (on average 1.3978328173374612) internal successors, (903), 658 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 903 transitions. [2022-01-11 03:29:49,054 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 903 transitions. Word has length 30 [2022-01-11 03:29:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:49,054 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 903 transitions. [2022-01-11 03:29:49,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 903 transitions. [2022-01-11 03:29:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 03:29:49,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:49,056 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:49,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:29:49,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1069540992, now seen corresponding path program 1 times [2022-01-11 03:29:49,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6454824] [2022-01-11 03:29:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:49,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:49,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6454824] [2022-01-11 03:29:49,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6454824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:49,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:49,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:49,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991064991] [2022-01-11 03:29:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:49,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:49,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:49,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:49,111 INFO L87 Difference]: Start difference. First operand 659 states and 903 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:49,347 INFO L93 Difference]: Finished difference Result 942 states and 1258 transitions. [2022-01-11 03:29:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:49,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-11 03:29:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:49,350 INFO L225 Difference]: With dead ends: 942 [2022-01-11 03:29:49,350 INFO L226 Difference]: Without dead ends: 693 [2022-01-11 03:29:49,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:49,351 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 984 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:49,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [984 Valid, 916 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-01-11 03:29:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 642. [2022-01-11 03:29:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 630 states have (on average 1.3761904761904762) internal successors, (867), 641 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2022-01-11 03:29:49,389 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 31 [2022-01-11 03:29:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:49,390 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2022-01-11 03:29:49,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2022-01-11 03:29:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 03:29:49,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:49,391 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:49,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:29:49,391 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 936407150, now seen corresponding path program 1 times [2022-01-11 03:29:49,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505994122] [2022-01-11 03:29:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:49,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:49,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505994122] [2022-01-11 03:29:49,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505994122] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:49,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:49,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:49,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11759907] [2022-01-11 03:29:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:49,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:49,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:49,436 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:49,630 INFO L93 Difference]: Finished difference Result 647 states and 871 transitions. [2022-01-11 03:29:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:49,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-11 03:29:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:49,633 INFO L225 Difference]: With dead ends: 647 [2022-01-11 03:29:49,633 INFO L226 Difference]: Without dead ends: 642 [2022-01-11 03:29:49,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:49,634 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 630 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:49,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1040 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-01-11 03:29:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2022-01-11 03:29:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 630 states have (on average 1.3746031746031746) internal successors, (866), 641 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 866 transitions. [2022-01-11 03:29:49,678 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 866 transitions. Word has length 32 [2022-01-11 03:29:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:49,678 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 866 transitions. [2022-01-11 03:29:49,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 866 transitions. [2022-01-11 03:29:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 03:29:49,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:49,679 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:49,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:29:49,679 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1066933234, now seen corresponding path program 1 times [2022-01-11 03:29:49,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839446890] [2022-01-11 03:29:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:49,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:49,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839446890] [2022-01-11 03:29:49,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839446890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:49,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:49,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:49,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593587312] [2022-01-11 03:29:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:49,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:49,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:49,740 INFO L87 Difference]: Start difference. First operand 642 states and 866 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:49,935 INFO L93 Difference]: Finished difference Result 647 states and 870 transitions. [2022-01-11 03:29:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-11 03:29:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:49,938 INFO L225 Difference]: With dead ends: 647 [2022-01-11 03:29:49,938 INFO L226 Difference]: Without dead ends: 642 [2022-01-11 03:29:49,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:49,939 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 627 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:49,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 1041 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-01-11 03:29:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2022-01-11 03:29:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 630 states have (on average 1.373015873015873) internal successors, (865), 641 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 865 transitions. [2022-01-11 03:29:49,986 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 865 transitions. Word has length 33 [2022-01-11 03:29:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:49,987 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 865 transitions. [2022-01-11 03:29:49,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 865 transitions. [2022-01-11 03:29:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 03:29:49,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:49,988 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:49,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 03:29:49,988 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1329434303, now seen corresponding path program 1 times [2022-01-11 03:29:49,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:49,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003927474] [2022-01-11 03:29:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:49,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:50,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:50,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003927474] [2022-01-11 03:29:50,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003927474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:50,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:50,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:50,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338664957] [2022-01-11 03:29:50,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:50,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:50,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:50,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:50,028 INFO L87 Difference]: Start difference. First operand 642 states and 865 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:50,225 INFO L93 Difference]: Finished difference Result 821 states and 1090 transitions. [2022-01-11 03:29:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-11 03:29:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:50,228 INFO L225 Difference]: With dead ends: 821 [2022-01-11 03:29:50,228 INFO L226 Difference]: Without dead ends: 798 [2022-01-11 03:29:50,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:50,229 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 175 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:50,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1080 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-01-11 03:29:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 680. [2022-01-11 03:29:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 668 states have (on average 1.3592814371257484) internal successors, (908), 679 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 908 transitions. [2022-01-11 03:29:50,286 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 908 transitions. Word has length 33 [2022-01-11 03:29:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:50,287 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 908 transitions. [2022-01-11 03:29:50,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 908 transitions. [2022-01-11 03:29:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 03:29:50,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:50,288 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:50,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 03:29:50,288 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:50,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1262335991, now seen corresponding path program 1 times [2022-01-11 03:29:50,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:50,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336282209] [2022-01-11 03:29:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:50,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:50,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:50,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336282209] [2022-01-11 03:29:50,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336282209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:50,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:50,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:29:50,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658989004] [2022-01-11 03:29:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:50,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:29:50,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:29:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:29:50,339 INFO L87 Difference]: Start difference. First operand 680 states and 908 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:50,429 INFO L93 Difference]: Finished difference Result 693 states and 920 transitions. [2022-01-11 03:29:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:29:50,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 03:29:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:50,432 INFO L225 Difference]: With dead ends: 693 [2022-01-11 03:29:50,432 INFO L226 Difference]: Without dead ends: 672 [2022-01-11 03:29:50,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:29:50,433 INFO L933 BasicCegarLoop]: 604 mSDtfsCounter, 33 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:50,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 3012 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-01-11 03:29:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2022-01-11 03:29:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.3590909090909091) internal successors, (897), 671 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 897 transitions. [2022-01-11 03:29:50,483 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 897 transitions. Word has length 34 [2022-01-11 03:29:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:50,484 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 897 transitions. [2022-01-11 03:29:50,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 897 transitions. [2022-01-11 03:29:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 03:29:50,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:50,485 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:50,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 03:29:50,485 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1736190510, now seen corresponding path program 1 times [2022-01-11 03:29:50,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670112117] [2022-01-11 03:29:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:50,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:50,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670112117] [2022-01-11 03:29:50,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670112117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:50,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:50,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:50,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280854901] [2022-01-11 03:29:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:50,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:50,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:50,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:50,528 INFO L87 Difference]: Start difference. First operand 672 states and 897 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:50,771 INFO L93 Difference]: Finished difference Result 798 states and 1061 transitions. [2022-01-11 03:29:50,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:50,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 03:29:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:50,774 INFO L225 Difference]: With dead ends: 798 [2022-01-11 03:29:50,774 INFO L226 Difference]: Without dead ends: 790 [2022-01-11 03:29:50,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:50,775 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 898 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:50,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [898 Valid, 1041 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-01-11 03:29:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 672. [2022-01-11 03:29:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.3575757575757577) internal successors, (896), 671 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 896 transitions. [2022-01-11 03:29:50,838 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 896 transitions. Word has length 34 [2022-01-11 03:29:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:50,839 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 896 transitions. [2022-01-11 03:29:50,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 896 transitions. [2022-01-11 03:29:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 03:29:50,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:50,840 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:50,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 03:29:50,840 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash -269981295, now seen corresponding path program 1 times [2022-01-11 03:29:50,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669699071] [2022-01-11 03:29:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:50,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:50,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:50,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669699071] [2022-01-11 03:29:50,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669699071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:50,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:50,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:50,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627395002] [2022-01-11 03:29:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:50,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:50,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:50,887 INFO L87 Difference]: Start difference. First operand 672 states and 896 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:50,998 INFO L93 Difference]: Finished difference Result 690 states and 913 transitions. [2022-01-11 03:29:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 03:29:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:51,001 INFO L225 Difference]: With dead ends: 690 [2022-01-11 03:29:51,001 INFO L226 Difference]: Without dead ends: 672 [2022-01-11 03:29:51,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:51,002 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 21 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:51,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2343 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-01-11 03:29:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2022-01-11 03:29:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.3424242424242425) internal successors, (886), 671 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 886 transitions. [2022-01-11 03:29:51,058 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 886 transitions. Word has length 34 [2022-01-11 03:29:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:51,058 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 886 transitions. [2022-01-11 03:29:51,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 886 transitions. [2022-01-11 03:29:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 03:29:51,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:51,059 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:51,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 03:29:51,059 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 953353763, now seen corresponding path program 1 times [2022-01-11 03:29:51,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:51,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274629581] [2022-01-11 03:29:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:51,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:51,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:51,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274629581] [2022-01-11 03:29:51,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274629581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:51,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:51,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:51,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261829017] [2022-01-11 03:29:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:51,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:51,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:51,118 INFO L87 Difference]: Start difference. First operand 672 states and 886 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:51,308 INFO L93 Difference]: Finished difference Result 882 states and 1164 transitions. [2022-01-11 03:29:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 03:29:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:51,311 INFO L225 Difference]: With dead ends: 882 [2022-01-11 03:29:51,311 INFO L226 Difference]: Without dead ends: 674 [2022-01-11 03:29:51,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:51,312 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 27 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:51,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1045 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-01-11 03:29:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-01-11 03:29:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 664 states have (on average 1.338855421686747) internal successors, (889), 673 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 889 transitions. [2022-01-11 03:29:51,376 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 889 transitions. Word has length 34 [2022-01-11 03:29:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:51,376 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 889 transitions. [2022-01-11 03:29:51,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 889 transitions. [2022-01-11 03:29:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 03:29:51,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:51,378 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:51,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 03:29:51,378 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1011453187, now seen corresponding path program 1 times [2022-01-11 03:29:51,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310649350] [2022-01-11 03:29:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:51,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:51,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:51,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310649350] [2022-01-11 03:29:51,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310649350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:51,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:51,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:51,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511372103] [2022-01-11 03:29:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:51,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:51,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:51,414 INFO L87 Difference]: Start difference. First operand 674 states and 889 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:51,488 INFO L93 Difference]: Finished difference Result 855 states and 1120 transitions. [2022-01-11 03:29:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 03:29:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:51,491 INFO L225 Difference]: With dead ends: 855 [2022-01-11 03:29:51,491 INFO L226 Difference]: Without dead ends: 650 [2022-01-11 03:29:51,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:51,492 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 201 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:51,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 965 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-01-11 03:29:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 634. [2022-01-11 03:29:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 624 states have (on average 1.3317307692307692) internal successors, (831), 633 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 831 transitions. [2022-01-11 03:29:51,546 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 831 transitions. Word has length 34 [2022-01-11 03:29:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:51,546 INFO L470 AbstractCegarLoop]: Abstraction has 634 states and 831 transitions. [2022-01-11 03:29:51,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 831 transitions. [2022-01-11 03:29:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:51,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:51,548 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:51,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 03:29:51,548 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1981885226, now seen corresponding path program 1 times [2022-01-11 03:29:51,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856430525] [2022-01-11 03:29:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:51,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:51,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856430525] [2022-01-11 03:29:51,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856430525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:51,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:51,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:51,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337810578] [2022-01-11 03:29:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:51,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:51,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:51,591 INFO L87 Difference]: Start difference. First operand 634 states and 831 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:51,843 INFO L93 Difference]: Finished difference Result 752 states and 987 transitions. [2022-01-11 03:29:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:51,846 INFO L225 Difference]: With dead ends: 752 [2022-01-11 03:29:51,846 INFO L226 Difference]: Without dead ends: 749 [2022-01-11 03:29:51,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:51,847 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 870 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:51,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [870 Valid, 1009 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-01-11 03:29:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 636. [2022-01-11 03:29:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 626 states have (on average 1.3306709265175718) internal successors, (833), 635 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 833 transitions. [2022-01-11 03:29:51,904 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 833 transitions. Word has length 35 [2022-01-11 03:29:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:51,905 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 833 transitions. [2022-01-11 03:29:51,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 833 transitions. [2022-01-11 03:29:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:51,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:51,906 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:51,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 03:29:51,906 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1981886251, now seen corresponding path program 1 times [2022-01-11 03:29:51,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230876375] [2022-01-11 03:29:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:51,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:51,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:51,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230876375] [2022-01-11 03:29:51,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230876375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:51,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:51,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:51,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413215786] [2022-01-11 03:29:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:51,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:51,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:51,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:51,955 INFO L87 Difference]: Start difference. First operand 636 states and 833 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:52,188 INFO L93 Difference]: Finished difference Result 641 states and 837 transitions. [2022-01-11 03:29:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:52,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:52,190 INFO L225 Difference]: With dead ends: 641 [2022-01-11 03:29:52,190 INFO L226 Difference]: Without dead ends: 598 [2022-01-11 03:29:52,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:52,191 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 636 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:52,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 853 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-01-11 03:29:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-01-11 03:29:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 588 states have (on average 1.3299319727891157) internal successors, (782), 597 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 782 transitions. [2022-01-11 03:29:52,257 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 782 transitions. Word has length 35 [2022-01-11 03:29:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:52,257 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 782 transitions. [2022-01-11 03:29:52,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 782 transitions. [2022-01-11 03:29:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:52,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:52,258 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:52,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 03:29:52,258 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1837736447, now seen corresponding path program 1 times [2022-01-11 03:29:52,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827788124] [2022-01-11 03:29:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:52,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:52,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:52,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827788124] [2022-01-11 03:29:52,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827788124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:52,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:52,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:52,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196824345] [2022-01-11 03:29:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:52,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:52,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:52,307 INFO L87 Difference]: Start difference. First operand 598 states and 782 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:52,514 INFO L93 Difference]: Finished difference Result 1169 states and 1516 transitions. [2022-01-11 03:29:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:52,517 INFO L225 Difference]: With dead ends: 1169 [2022-01-11 03:29:52,517 INFO L226 Difference]: Without dead ends: 895 [2022-01-11 03:29:52,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:52,518 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 230 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:52,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 1030 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-01-11 03:29:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 635. [2022-01-11 03:29:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 625 states have (on average 1.3312) internal successors, (832), 634 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 832 transitions. [2022-01-11 03:29:52,574 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 832 transitions. Word has length 35 [2022-01-11 03:29:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:52,574 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 832 transitions. [2022-01-11 03:29:52,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 832 transitions. [2022-01-11 03:29:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:52,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:52,575 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:52,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 03:29:52,575 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1708653728, now seen corresponding path program 1 times [2022-01-11 03:29:52,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:52,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062103704] [2022-01-11 03:29:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:52,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:52,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:52,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062103704] [2022-01-11 03:29:52,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062103704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:52,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:52,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:52,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448241351] [2022-01-11 03:29:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:52,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:52,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:52,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:52,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:52,611 INFO L87 Difference]: Start difference. First operand 635 states and 832 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:52,774 INFO L93 Difference]: Finished difference Result 703 states and 907 transitions. [2022-01-11 03:29:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:52,777 INFO L225 Difference]: With dead ends: 703 [2022-01-11 03:29:52,777 INFO L226 Difference]: Without dead ends: 618 [2022-01-11 03:29:52,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:52,778 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 612 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:52,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 868 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-01-11 03:29:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 600. [2022-01-11 03:29:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 590 states have (on average 1.3084745762711865) internal successors, (772), 599 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 772 transitions. [2022-01-11 03:29:52,834 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 772 transitions. Word has length 35 [2022-01-11 03:29:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:52,834 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 772 transitions. [2022-01-11 03:29:52,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 772 transitions. [2022-01-11 03:29:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:52,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:52,835 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:52,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 03:29:52,835 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1872974016, now seen corresponding path program 1 times [2022-01-11 03:29:52,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:52,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878917430] [2022-01-11 03:29:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:52,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:52,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:52,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878917430] [2022-01-11 03:29:52,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878917430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:52,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:52,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:52,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404857276] [2022-01-11 03:29:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:52,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:52,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:52,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:52,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:52,875 INFO L87 Difference]: Start difference. First operand 600 states and 772 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:53,037 INFO L93 Difference]: Finished difference Result 675 states and 864 transitions. [2022-01-11 03:29:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:53,040 INFO L225 Difference]: With dead ends: 675 [2022-01-11 03:29:53,040 INFO L226 Difference]: Without dead ends: 620 [2022-01-11 03:29:53,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:53,041 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 108 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:53,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 1024 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-01-11 03:29:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 565. [2022-01-11 03:29:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 555 states have (on average 1.3135135135135134) internal successors, (729), 564 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 729 transitions. [2022-01-11 03:29:53,096 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 729 transitions. Word has length 35 [2022-01-11 03:29:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:53,096 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 729 transitions. [2022-01-11 03:29:53,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 729 transitions. [2022-01-11 03:29:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:53,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:53,097 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:53,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 03:29:53,097 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1703807636, now seen corresponding path program 1 times [2022-01-11 03:29:53,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:53,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888123234] [2022-01-11 03:29:53,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:53,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:53,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:53,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888123234] [2022-01-11 03:29:53,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888123234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:53,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:53,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:53,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322758187] [2022-01-11 03:29:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:53,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:53,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:53,146 INFO L87 Difference]: Start difference. First operand 565 states and 729 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:53,242 INFO L93 Difference]: Finished difference Result 583 states and 746 transitions. [2022-01-11 03:29:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:53,244 INFO L225 Difference]: With dead ends: 583 [2022-01-11 03:29:53,244 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 03:29:53,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:53,245 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 21 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:53,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2109 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 03:29:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 03:29:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 555 states have (on average 1.308108108108108) internal successors, (726), 564 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 726 transitions. [2022-01-11 03:29:53,307 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 726 transitions. Word has length 35 [2022-01-11 03:29:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:53,307 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 726 transitions. [2022-01-11 03:29:53,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 726 transitions. [2022-01-11 03:29:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:53,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:53,308 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:53,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 03:29:53,309 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1594087307, now seen corresponding path program 1 times [2022-01-11 03:29:53,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:53,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113660706] [2022-01-11 03:29:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:53,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:53,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:53,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113660706] [2022-01-11 03:29:53,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113660706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:53,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:53,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:53,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327428995] [2022-01-11 03:29:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:53,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:53,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:53,352 INFO L87 Difference]: Start difference. First operand 565 states and 726 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:53,455 INFO L93 Difference]: Finished difference Result 581 states and 741 transitions. [2022-01-11 03:29:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:53,458 INFO L225 Difference]: With dead ends: 581 [2022-01-11 03:29:53,458 INFO L226 Difference]: Without dead ends: 555 [2022-01-11 03:29:53,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:53,459 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 536 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:53,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 1587 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-01-11 03:29:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2022-01-11 03:29:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 545 states have (on average 1.306422018348624) internal successors, (712), 554 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 712 transitions. [2022-01-11 03:29:53,513 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 712 transitions. Word has length 35 [2022-01-11 03:29:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:53,514 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 712 transitions. [2022-01-11 03:29:53,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 712 transitions. [2022-01-11 03:29:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 03:29:53,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:53,515 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:53,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 03:29:53,515 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1491787111, now seen corresponding path program 1 times [2022-01-11 03:29:53,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:53,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261358680] [2022-01-11 03:29:53,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:53,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:53,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261358680] [2022-01-11 03:29:53,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261358680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:53,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:53,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:53,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192261731] [2022-01-11 03:29:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:53,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:53,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:53,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:53,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:53,558 INFO L87 Difference]: Start difference. First operand 555 states and 712 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:53,651 INFO L93 Difference]: Finished difference Result 615 states and 773 transitions. [2022-01-11 03:29:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:53,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-11 03:29:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:53,654 INFO L225 Difference]: With dead ends: 615 [2022-01-11 03:29:53,654 INFO L226 Difference]: Without dead ends: 592 [2022-01-11 03:29:53,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:53,654 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 71 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:53,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 2081 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-01-11 03:29:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 558. [2022-01-11 03:29:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 548 states have (on average 1.3047445255474452) internal successors, (715), 557 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 715 transitions. [2022-01-11 03:29:53,713 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 715 transitions. Word has length 35 [2022-01-11 03:29:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:53,714 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 715 transitions. [2022-01-11 03:29:53,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 715 transitions. [2022-01-11 03:29:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 03:29:53,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:53,715 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:53,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 03:29:53,715 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:53,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2068366705, now seen corresponding path program 1 times [2022-01-11 03:29:53,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:53,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137131873] [2022-01-11 03:29:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:53,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:53,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137131873] [2022-01-11 03:29:53,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137131873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:53,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:53,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:53,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884418443] [2022-01-11 03:29:53,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:53,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:53,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:53,758 INFO L87 Difference]: Start difference. First operand 558 states and 715 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:53,925 INFO L93 Difference]: Finished difference Result 613 states and 787 transitions. [2022-01-11 03:29:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-11 03:29:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:53,928 INFO L225 Difference]: With dead ends: 613 [2022-01-11 03:29:53,928 INFO L226 Difference]: Without dead ends: 610 [2022-01-11 03:29:53,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:53,929 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 607 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:53,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 959 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-11 03:29:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 556. [2022-01-11 03:29:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 546 states have (on average 1.304029304029304) internal successors, (712), 555 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 712 transitions. [2022-01-11 03:29:53,981 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 712 transitions. Word has length 36 [2022-01-11 03:29:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:53,981 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 712 transitions. [2022-01-11 03:29:53,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 712 transitions. [2022-01-11 03:29:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 03:29:53,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:53,982 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:53,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 03:29:53,982 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2068367730, now seen corresponding path program 1 times [2022-01-11 03:29:53,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:53,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791420755] [2022-01-11 03:29:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:53,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:54,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791420755] [2022-01-11 03:29:54,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791420755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:54,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:54,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:29:54,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563108947] [2022-01-11 03:29:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:54,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:29:54,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:29:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:54,084 INFO L87 Difference]: Start difference. First operand 556 states and 712 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:54,447 INFO L93 Difference]: Finished difference Result 820 states and 1036 transitions. [2022-01-11 03:29:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:29:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-11 03:29:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:54,450 INFO L225 Difference]: With dead ends: 820 [2022-01-11 03:29:54,451 INFO L226 Difference]: Without dead ends: 797 [2022-01-11 03:29:54,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:29:54,451 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 374 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:54,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 2826 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-01-11 03:29:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 554. [2022-01-11 03:29:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 544 states have (on average 1.3014705882352942) internal successors, (708), 553 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 708 transitions. [2022-01-11 03:29:54,508 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 708 transitions. Word has length 36 [2022-01-11 03:29:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:54,508 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 708 transitions. [2022-01-11 03:29:54,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 708 transitions. [2022-01-11 03:29:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 03:29:54,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:54,511 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:54,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 03:29:54,511 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1496610181, now seen corresponding path program 1 times [2022-01-11 03:29:54,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055255525] [2022-01-11 03:29:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:54,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:54,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055255525] [2022-01-11 03:29:54,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055255525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:54,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:54,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:29:54,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068356667] [2022-01-11 03:29:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:54,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:29:54,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:29:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:29:54,589 INFO L87 Difference]: Start difference. First operand 554 states and 708 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:54,836 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-01-11 03:29:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:29:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-11 03:29:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:54,839 INFO L225 Difference]: With dead ends: 585 [2022-01-11 03:29:54,839 INFO L226 Difference]: Without dead ends: 544 [2022-01-11 03:29:54,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:29:54,839 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 350 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:54,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 2105 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-01-11 03:29:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 523. [2022-01-11 03:29:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 513 states have (on average 1.307992202729045) internal successors, (671), 522 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 671 transitions. [2022-01-11 03:29:54,904 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 671 transitions. Word has length 37 [2022-01-11 03:29:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:54,905 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 671 transitions. [2022-01-11 03:29:54,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 671 transitions. [2022-01-11 03:29:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 03:29:54,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:54,908 INFO L514 BasicCegarLoop]: trace 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] [2022-01-11 03:29:54,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 03:29:54,908 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1765651113, now seen corresponding path program 1 times [2022-01-11 03:29:54,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:54,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109626075] [2022-01-11 03:29:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:54,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:54,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:54,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109626075] [2022-01-11 03:29:54,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109626075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:54,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:54,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:54,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14852777] [2022-01-11 03:29:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:54,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:54,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:54,960 INFO L87 Difference]: Start difference. First operand 523 states and 671 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:55,038 INFO L93 Difference]: Finished difference Result 786 states and 1009 transitions. [2022-01-11 03:29:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-11 03:29:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:55,041 INFO L225 Difference]: With dead ends: 786 [2022-01-11 03:29:55,041 INFO L226 Difference]: Without dead ends: 585 [2022-01-11 03:29:55,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:55,042 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 174 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:55,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 871 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-11 03:29:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 511. [2022-01-11 03:29:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 504 states have (on average 1.2956349206349207) internal successors, (653), 510 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 653 transitions. [2022-01-11 03:29:55,097 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 653 transitions. Word has length 37 [2022-01-11 03:29:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:55,098 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 653 transitions. [2022-01-11 03:29:55,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 653 transitions. [2022-01-11 03:29:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-11 03:29:55,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:55,099 INFO L514 BasicCegarLoop]: trace 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, 1, 1] [2022-01-11 03:29:55,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 03:29:55,099 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1493220792, now seen corresponding path program 1 times [2022-01-11 03:29:55,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:55,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468975066] [2022-01-11 03:29:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:55,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:55,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:55,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468975066] [2022-01-11 03:29:55,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468975066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:55,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:55,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:55,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157512127] [2022-01-11 03:29:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:55,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:55,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:55,158 INFO L87 Difference]: Start difference. First operand 511 states and 653 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:55,266 INFO L93 Difference]: Finished difference Result 710 states and 906 transitions. [2022-01-11 03:29:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-11 03:29:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:55,268 INFO L225 Difference]: With dead ends: 710 [2022-01-11 03:29:55,268 INFO L226 Difference]: Without dead ends: 493 [2022-01-11 03:29:55,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:55,269 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:55,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1067 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-01-11 03:29:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 477. [2022-01-11 03:29:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 471 states have (on average 1.2802547770700636) internal successors, (603), 476 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 603 transitions. [2022-01-11 03:29:55,332 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 603 transitions. Word has length 39 [2022-01-11 03:29:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:55,332 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 603 transitions. [2022-01-11 03:29:55,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 603 transitions. [2022-01-11 03:29:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 03:29:55,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:55,333 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1] [2022-01-11 03:29:55,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 03:29:55,333 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1002689332, now seen corresponding path program 1 times [2022-01-11 03:29:55,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:55,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587807554] [2022-01-11 03:29:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:55,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:55,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587807554] [2022-01-11 03:29:55,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587807554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:55,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:55,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:29:55,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20141915] [2022-01-11 03:29:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:55,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:29:55,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:29:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:29:55,380 INFO L87 Difference]: Start difference. First operand 477 states and 603 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:55,487 INFO L93 Difference]: Finished difference Result 511 states and 636 transitions. [2022-01-11 03:29:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:29:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-11 03:29:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:55,489 INFO L225 Difference]: With dead ends: 511 [2022-01-11 03:29:55,489 INFO L226 Difference]: Without dead ends: 492 [2022-01-11 03:29:55,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:29:55,490 INFO L933 BasicCegarLoop]: 458 mSDtfsCounter, 57 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:55,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 2282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-11 03:29:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 474. [2022-01-11 03:29:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 468 states have (on average 1.2799145299145298) internal successors, (599), 473 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 599 transitions. [2022-01-11 03:29:55,541 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 599 transitions. Word has length 40 [2022-01-11 03:29:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:55,541 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 599 transitions. [2022-01-11 03:29:55,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 599 transitions. [2022-01-11 03:29:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 03:29:55,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:55,542 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1] [2022-01-11 03:29:55,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 03:29:55,542 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 704122211, now seen corresponding path program 1 times [2022-01-11 03:29:55,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462681716] [2022-01-11 03:29:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:55,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:55,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462681716] [2022-01-11 03:29:55,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462681716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:55,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:55,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:55,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822654041] [2022-01-11 03:29:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:55,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:55,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:55,595 INFO L87 Difference]: Start difference. First operand 474 states and 599 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:55,692 INFO L93 Difference]: Finished difference Result 490 states and 615 transitions. [2022-01-11 03:29:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-11 03:29:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:55,702 INFO L225 Difference]: With dead ends: 490 [2022-01-11 03:29:55,702 INFO L226 Difference]: Without dead ends: 470 [2022-01-11 03:29:55,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:55,703 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 22 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:55,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 1824 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-01-11 03:29:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-01-11 03:29:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 464 states have (on average 1.2780172413793103) internal successors, (593), 469 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 593 transitions. [2022-01-11 03:29:55,749 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 593 transitions. Word has length 40 [2022-01-11 03:29:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:55,749 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 593 transitions. [2022-01-11 03:29:55,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 593 transitions. [2022-01-11 03:29:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-11 03:29:55,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:55,750 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1] [2022-01-11 03:29:55,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 03:29:55,750 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1563839091, now seen corresponding path program 1 times [2022-01-11 03:29:55,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:55,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093500552] [2022-01-11 03:29:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:55,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:55,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:55,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093500552] [2022-01-11 03:29:55,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093500552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:55,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:55,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:29:55,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773508504] [2022-01-11 03:29:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:55,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:29:55,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:55,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:29:55,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:55,834 INFO L87 Difference]: Start difference. First operand 470 states and 593 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:56,132 INFO L93 Difference]: Finished difference Result 706 states and 883 transitions. [2022-01-11 03:29:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:29:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-11 03:29:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:56,140 INFO L225 Difference]: With dead ends: 706 [2022-01-11 03:29:56,140 INFO L226 Difference]: Without dead ends: 689 [2022-01-11 03:29:56,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:29:56,141 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 343 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:56,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 2502 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:29:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-01-11 03:29:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 469. [2022-01-11 03:29:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 463 states have (on average 1.2764578833693305) internal successors, (591), 468 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 591 transitions. [2022-01-11 03:29:56,214 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 591 transitions. Word has length 41 [2022-01-11 03:29:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:56,214 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 591 transitions. [2022-01-11 03:29:56,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 591 transitions. [2022-01-11 03:29:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-11 03:29:56,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:56,215 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1] [2022-01-11 03:29:56,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 03:29:56,215 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1022012029, now seen corresponding path program 1 times [2022-01-11 03:29:56,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:56,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683085506] [2022-01-11 03:29:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:56,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:56,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683085506] [2022-01-11 03:29:56,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683085506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:56,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:56,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:56,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614053366] [2022-01-11 03:29:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:56,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:56,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:56,276 INFO L87 Difference]: Start difference. First operand 469 states and 591 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:56,424 INFO L93 Difference]: Finished difference Result 652 states and 826 transitions. [2022-01-11 03:29:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-11 03:29:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:56,426 INFO L225 Difference]: With dead ends: 652 [2022-01-11 03:29:56,426 INFO L226 Difference]: Without dead ends: 469 [2022-01-11 03:29:56,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:56,427 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 452 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:56,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 758 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-01-11 03:29:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-01-11 03:29:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 463 states have (on average 1.263498920086393) internal successors, (585), 468 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 585 transitions. [2022-01-11 03:29:56,481 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 585 transitions. Word has length 41 [2022-01-11 03:29:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:56,481 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 585 transitions. [2022-01-11 03:29:56,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 585 transitions. [2022-01-11 03:29:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 03:29:56,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:56,482 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2022-01-11 03:29:56,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 03:29:56,483 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 770428510, now seen corresponding path program 1 times [2022-01-11 03:29:56,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:56,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406361229] [2022-01-11 03:29:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:56,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:56,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406361229] [2022-01-11 03:29:56,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406361229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:56,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:56,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:29:56,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795714662] [2022-01-11 03:29:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:56,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:29:56,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:29:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:29:56,560 INFO L87 Difference]: Start difference. First operand 469 states and 585 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:56,786 INFO L93 Difference]: Finished difference Result 497 states and 610 transitions. [2022-01-11 03:29:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:29:56,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-11 03:29:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:56,788 INFO L225 Difference]: With dead ends: 497 [2022-01-11 03:29:56,788 INFO L226 Difference]: Without dead ends: 473 [2022-01-11 03:29:56,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 03:29:56,789 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 326 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:56,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 1850 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-01-11 03:29:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 456. [2022-01-11 03:29:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 450 states have (on average 1.2666666666666666) internal successors, (570), 455 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 570 transitions. [2022-01-11 03:29:56,855 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 570 transitions. Word has length 42 [2022-01-11 03:29:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:56,855 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 570 transitions. [2022-01-11 03:29:56,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 570 transitions. [2022-01-11 03:29:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:29:56,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:56,856 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:56,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 03:29:56,856 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash -415760886, now seen corresponding path program 1 times [2022-01-11 03:29:56,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:56,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543022915] [2022-01-11 03:29:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:56,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:56,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:56,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543022915] [2022-01-11 03:29:56,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543022915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:56,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:56,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:56,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580600715] [2022-01-11 03:29:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:56,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:56,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:56,901 INFO L87 Difference]: Start difference. First operand 456 states and 570 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:56,996 INFO L93 Difference]: Finished difference Result 622 states and 758 transitions. [2022-01-11 03:29:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 03:29:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:56,998 INFO L225 Difference]: With dead ends: 622 [2022-01-11 03:29:56,998 INFO L226 Difference]: Without dead ends: 548 [2022-01-11 03:29:56,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:57,007 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 98 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:57,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 1418 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-01-11 03:29:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 460. [2022-01-11 03:29:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 454 states have (on average 1.2643171806167401) internal successors, (574), 459 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 574 transitions. [2022-01-11 03:29:57,073 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 574 transitions. Word has length 44 [2022-01-11 03:29:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:57,074 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 574 transitions. [2022-01-11 03:29:57,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 574 transitions. [2022-01-11 03:29:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:29:57,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:57,075 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:57,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 03:29:57,076 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2037662186, now seen corresponding path program 1 times [2022-01-11 03:29:57,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:57,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770710397] [2022-01-11 03:29:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:57,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:57,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770710397] [2022-01-11 03:29:57,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770710397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:57,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:57,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:29:57,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585409551] [2022-01-11 03:29:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:57,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:29:57,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:29:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:57,134 INFO L87 Difference]: Start difference. First operand 460 states and 574 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:57,279 INFO L93 Difference]: Finished difference Result 607 states and 737 transitions. [2022-01-11 03:29:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:29:57,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 03:29:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:57,281 INFO L225 Difference]: With dead ends: 607 [2022-01-11 03:29:57,281 INFO L226 Difference]: Without dead ends: 519 [2022-01-11 03:29:57,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:29:57,282 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 238 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:57,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 2609 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-11 03:29:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 463. [2022-01-11 03:29:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 457 states have (on average 1.2582056892778994) internal successors, (575), 462 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 575 transitions. [2022-01-11 03:29:57,345 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 575 transitions. Word has length 44 [2022-01-11 03:29:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:57,345 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 575 transitions. [2022-01-11 03:29:57,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 575 transitions. [2022-01-11 03:29:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:29:57,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:57,346 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:57,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 03:29:57,346 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 934339620, now seen corresponding path program 1 times [2022-01-11 03:29:57,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:57,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053243667] [2022-01-11 03:29:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:57,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:57,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:57,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053243667] [2022-01-11 03:29:57,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053243667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:57,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:57,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:29:57,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672589067] [2022-01-11 03:29:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:57,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:29:57,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:29:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:57,383 INFO L87 Difference]: Start difference. First operand 463 states and 575 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:57,523 INFO L93 Difference]: Finished difference Result 796 states and 989 transitions. [2022-01-11 03:29:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:29:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 03:29:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:57,525 INFO L225 Difference]: With dead ends: 796 [2022-01-11 03:29:57,525 INFO L226 Difference]: Without dead ends: 613 [2022-01-11 03:29:57,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:29:57,526 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 165 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:57,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 981 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-01-11 03:29:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 463. [2022-01-11 03:29:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 457 states have (on average 1.2582056892778994) internal successors, (575), 462 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 575 transitions. [2022-01-11 03:29:57,586 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 575 transitions. Word has length 44 [2022-01-11 03:29:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:57,586 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 575 transitions. [2022-01-11 03:29:57,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 575 transitions. [2022-01-11 03:29:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 03:29:57,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:57,587 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:57,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 03:29:57,587 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1059125244, now seen corresponding path program 1 times [2022-01-11 03:29:57,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:57,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703716202] [2022-01-11 03:29:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:57,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:57,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703716202] [2022-01-11 03:29:57,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703716202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:57,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:57,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:57,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725327012] [2022-01-11 03:29:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:57,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:57,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:57,670 INFO L87 Difference]: Start difference. First operand 463 states and 575 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:57,907 INFO L93 Difference]: Finished difference Result 744 states and 922 transitions. [2022-01-11 03:29:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:29:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 03:29:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:57,911 INFO L225 Difference]: With dead ends: 744 [2022-01-11 03:29:57,911 INFO L226 Difference]: Without dead ends: 586 [2022-01-11 03:29:57,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:57,912 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 329 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:57,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 1927 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-01-11 03:29:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 463. [2022-01-11 03:29:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 457 states have (on average 1.24945295404814) internal successors, (571), 462 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 571 transitions. [2022-01-11 03:29:57,976 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 571 transitions. Word has length 44 [2022-01-11 03:29:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:57,977 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 571 transitions. [2022-01-11 03:29:57,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 571 transitions. [2022-01-11 03:29:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-11 03:29:57,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:57,980 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:57,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 03:29:57,980 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1722616656, now seen corresponding path program 1 times [2022-01-11 03:29:57,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:57,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461730515] [2022-01-11 03:29:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:57,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:58,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461730515] [2022-01-11 03:29:58,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461730515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:58,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:58,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:58,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191071222] [2022-01-11 03:29:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:58,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:58,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:58,035 INFO L87 Difference]: Start difference. First operand 463 states and 571 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:58,150 INFO L93 Difference]: Finished difference Result 992 states and 1207 transitions. [2022-01-11 03:29:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:58,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-01-11 03:29:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:58,151 INFO L225 Difference]: With dead ends: 992 [2022-01-11 03:29:58,151 INFO L226 Difference]: Without dead ends: 570 [2022-01-11 03:29:58,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:58,153 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 459 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:58,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1005 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-01-11 03:29:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 509. [2022-01-11 03:29:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.234592445328032) internal successors, (621), 508 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2022-01-11 03:29:58,211 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 46 [2022-01-11 03:29:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:58,211 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2022-01-11 03:29:58,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2022-01-11 03:29:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-11 03:29:58,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:58,213 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:58,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-11 03:29:58,213 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1851699375, now seen corresponding path program 1 times [2022-01-11 03:29:58,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:58,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613327944] [2022-01-11 03:29:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:58,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:58,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:58,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613327944] [2022-01-11 03:29:58,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613327944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:58,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:58,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:29:58,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50297104] [2022-01-11 03:29:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:29:58,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:29:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:29:58,316 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:58,597 INFO L93 Difference]: Finished difference Result 685 states and 823 transitions. [2022-01-11 03:29:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 03:29:58,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-01-11 03:29:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:58,598 INFO L225 Difference]: With dead ends: 685 [2022-01-11 03:29:58,599 INFO L226 Difference]: Without dead ends: 603 [2022-01-11 03:29:58,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-11 03:29:58,601 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 545 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:58,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 2445 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-01-11 03:29:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 509. [2022-01-11 03:29:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.2226640159045725) internal successors, (615), 508 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 615 transitions. [2022-01-11 03:29:58,668 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 615 transitions. Word has length 46 [2022-01-11 03:29:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:58,668 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 615 transitions. [2022-01-11 03:29:58,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 615 transitions. [2022-01-11 03:29:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-11 03:29:58,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:58,669 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:58,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-11 03:29:58,670 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash 437417489, now seen corresponding path program 1 times [2022-01-11 03:29:58,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:58,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501697357] [2022-01-11 03:29:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:58,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:58,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501697357] [2022-01-11 03:29:58,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501697357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:58,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:58,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:29:58,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480833561] [2022-01-11 03:29:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:58,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:29:58,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:29:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:58,779 INFO L87 Difference]: Start difference. First operand 509 states and 615 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:59,039 INFO L93 Difference]: Finished difference Result 953 states and 1165 transitions. [2022-01-11 03:29:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:29:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-11 03:29:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:59,041 INFO L225 Difference]: With dead ends: 953 [2022-01-11 03:29:59,041 INFO L226 Difference]: Without dead ends: 822 [2022-01-11 03:29:59,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:29:59,042 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 528 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:59,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 2196 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-01-11 03:29:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 509. [2022-01-11 03:29:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.220675944333996) internal successors, (614), 508 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 614 transitions. [2022-01-11 03:29:59,110 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 614 transitions. Word has length 47 [2022-01-11 03:29:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:59,110 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 614 transitions. [2022-01-11 03:29:59,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 614 transitions. [2022-01-11 03:29:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-11 03:29:59,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:59,111 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:59,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-11 03:29:59,111 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:59,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1210787857, now seen corresponding path program 1 times [2022-01-11 03:29:59,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:59,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976958600] [2022-01-11 03:29:59,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:59,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:59,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:59,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976958600] [2022-01-11 03:29:59,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976958600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:59,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:59,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:29:59,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268263892] [2022-01-11 03:29:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:59,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:29:59,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:29:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:59,214 INFO L87 Difference]: Start difference. First operand 509 states and 614 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:59,480 INFO L93 Difference]: Finished difference Result 545 states and 647 transitions. [2022-01-11 03:29:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:29:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-11 03:29:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:59,482 INFO L225 Difference]: With dead ends: 545 [2022-01-11 03:29:59,482 INFO L226 Difference]: Without dead ends: 370 [2022-01-11 03:29:59,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:29:59,483 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 398 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:59,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 2095 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:29:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-01-11 03:29:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 339. [2022-01-11 03:29:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 338 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 412 transitions. [2022-01-11 03:29:59,535 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 412 transitions. Word has length 47 [2022-01-11 03:29:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:59,535 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 412 transitions. [2022-01-11 03:29:59,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 412 transitions. [2022-01-11 03:29:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-11 03:29:59,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:59,536 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:59,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-11 03:29:59,536 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash -899678092, now seen corresponding path program 1 times [2022-01-11 03:29:59,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:59,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530383646] [2022-01-11 03:29:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:59,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:59,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:59,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530383646] [2022-01-11 03:29:59,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530383646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:59,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:59,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:29:59,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270328730] [2022-01-11 03:29:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:59,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:29:59,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:29:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:29:59,587 INFO L87 Difference]: Start difference. First operand 339 states and 412 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:59,649 INFO L93 Difference]: Finished difference Result 380 states and 455 transitions. [2022-01-11 03:29:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:29:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-11 03:29:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:59,652 INFO L225 Difference]: With dead ends: 380 [2022-01-11 03:29:59,652 INFO L226 Difference]: Without dead ends: 338 [2022-01-11 03:29:59,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:29:59,653 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 8 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:59,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 849 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-01-11 03:29:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-01-11 03:29:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 332 states have (on average 1.2349397590361446) internal successors, (410), 337 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 410 transitions. [2022-01-11 03:29:59,705 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 410 transitions. Word has length 49 [2022-01-11 03:29:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:59,705 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 410 transitions. [2022-01-11 03:29:59,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 410 transitions. [2022-01-11 03:29:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-11 03:29:59,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:59,706 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:59,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-11 03:29:59,707 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2141993108, now seen corresponding path program 1 times [2022-01-11 03:29:59,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:59,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435394642] [2022-01-11 03:29:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:59,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:59,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:59,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435394642] [2022-01-11 03:29:59,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435394642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:59,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:59,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:29:59,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176003129] [2022-01-11 03:29:59,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:59,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:29:59,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:59,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:29:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:29:59,769 INFO L87 Difference]: Start difference. First operand 338 states and 410 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:29:59,865 INFO L93 Difference]: Finished difference Result 359 states and 429 transitions. [2022-01-11 03:29:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:29:59,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-11 03:29:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:29:59,866 INFO L225 Difference]: With dead ends: 359 [2022-01-11 03:29:59,866 INFO L226 Difference]: Without dead ends: 338 [2022-01-11 03:29:59,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:29:59,866 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 97 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:29:59,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1636 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:29:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-01-11 03:29:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 319. [2022-01-11 03:29:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 315 states have (on average 1.234920634920635) internal successors, (389), 318 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 389 transitions. [2022-01-11 03:29:59,902 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 389 transitions. Word has length 49 [2022-01-11 03:29:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:29:59,902 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 389 transitions. [2022-01-11 03:29:59,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:29:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 389 transitions. [2022-01-11 03:29:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-11 03:29:59,903 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:29:59,903 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:29:59,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-11 03:29:59,903 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:29:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:29:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 95483931, now seen corresponding path program 1 times [2022-01-11 03:29:59,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:29:59,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431325645] [2022-01-11 03:29:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:29:59,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:29:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:29:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:29:59,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:29:59,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431325645] [2022-01-11 03:29:59,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431325645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:29:59,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:29:59,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:29:59,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072697622] [2022-01-11 03:29:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:29:59,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:29:59,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:29:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:29:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:29:59,976 INFO L87 Difference]: Start difference. First operand 319 states and 389 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:00,120 INFO L93 Difference]: Finished difference Result 338 states and 407 transitions. [2022-01-11 03:30:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:00,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-11 03:30:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:00,121 INFO L225 Difference]: With dead ends: 338 [2022-01-11 03:30:00,121 INFO L226 Difference]: Without dead ends: 314 [2022-01-11 03:30:00,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:00,122 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 74 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:00,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 1883 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-01-11 03:30:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-01-11 03:30:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 310 states have (on average 1.235483870967742) internal successors, (383), 313 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 383 transitions. [2022-01-11 03:30:00,173 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 383 transitions. Word has length 49 [2022-01-11 03:30:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:00,173 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 383 transitions. [2022-01-11 03:30:00,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 383 transitions. [2022-01-11 03:30:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 03:30:00,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:00,174 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:00,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-11 03:30:00,174 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash -314207091, now seen corresponding path program 1 times [2022-01-11 03:30:00,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:00,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357177515] [2022-01-11 03:30:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:00,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:00,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357177515] [2022-01-11 03:30:00,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357177515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:00,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:00,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:00,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252015843] [2022-01-11 03:30:00,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:00,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:00,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:00,214 INFO L87 Difference]: Start difference. First operand 314 states and 383 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:00,294 INFO L93 Difference]: Finished difference Result 449 states and 554 transitions. [2022-01-11 03:30:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 03:30:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:00,295 INFO L225 Difference]: With dead ends: 449 [2022-01-11 03:30:00,295 INFO L226 Difference]: Without dead ends: 276 [2022-01-11 03:30:00,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:00,296 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 55 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:00,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 539 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-01-11 03:30:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-01-11 03:30:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 274 states have (on average 1.218978102189781) internal successors, (334), 275 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 334 transitions. [2022-01-11 03:30:00,340 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 334 transitions. Word has length 51 [2022-01-11 03:30:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:00,340 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 334 transitions. [2022-01-11 03:30:00,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 334 transitions. [2022-01-11 03:30:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-11 03:30:00,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:00,341 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:00,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-11 03:30:00,342 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash 874159025, now seen corresponding path program 1 times [2022-01-11 03:30:00,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:00,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621389957] [2022-01-11 03:30:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:00,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:00,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621389957] [2022-01-11 03:30:00,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621389957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:00,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:00,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:30:00,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194404329] [2022-01-11 03:30:00,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:00,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:30:00,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:30:00,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:00,409 INFO L87 Difference]: Start difference. First operand 276 states and 334 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:00,520 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2022-01-11 03:30:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-01-11 03:30:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:00,521 INFO L225 Difference]: With dead ends: 288 [2022-01-11 03:30:00,521 INFO L226 Difference]: Without dead ends: 229 [2022-01-11 03:30:00,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:00,522 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 79 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:00,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 1794 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-01-11 03:30:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-01-11 03:30:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 1.2158590308370043) internal successors, (276), 228 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 276 transitions. [2022-01-11 03:30:00,560 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 276 transitions. Word has length 54 [2022-01-11 03:30:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:00,560 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 276 transitions. [2022-01-11 03:30:00,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 276 transitions. [2022-01-11 03:30:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 03:30:00,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:00,561 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:00,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-11 03:30:00,561 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2060632170, now seen corresponding path program 1 times [2022-01-11 03:30:00,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:00,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234095334] [2022-01-11 03:30:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:00,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:00,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234095334] [2022-01-11 03:30:00,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234095334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:00,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:00,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:30:00,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039005650] [2022-01-11 03:30:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:00,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:30:00,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:30:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:00,627 INFO L87 Difference]: Start difference. First operand 229 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:00,788 INFO L93 Difference]: Finished difference Result 342 states and 410 transitions. [2022-01-11 03:30:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:30:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-11 03:30:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:00,789 INFO L225 Difference]: With dead ends: 342 [2022-01-11 03:30:00,789 INFO L226 Difference]: Without dead ends: 323 [2022-01-11 03:30:00,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:30:00,789 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 292 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:00,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1617 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-01-11 03:30:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 223. [2022-01-11 03:30:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 1.2171945701357465) internal successors, (269), 222 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 269 transitions. [2022-01-11 03:30:00,829 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 269 transitions. Word has length 59 [2022-01-11 03:30:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:00,829 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 269 transitions. [2022-01-11 03:30:00,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 269 transitions. [2022-01-11 03:30:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 03:30:00,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:00,830 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:00,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-11 03:30:00,830 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1480797736, now seen corresponding path program 1 times [2022-01-11 03:30:00,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:00,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635906429] [2022-01-11 03:30:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:00,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:00,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635906429] [2022-01-11 03:30:00,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635906429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:00,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:00,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:30:00,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225660316] [2022-01-11 03:30:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:00,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:30:00,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:30:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:00,904 INFO L87 Difference]: Start difference. First operand 223 states and 269 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:01,027 INFO L93 Difference]: Finished difference Result 289 states and 347 transitions. [2022-01-11 03:30:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:01,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-01-11 03:30:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:01,028 INFO L225 Difference]: With dead ends: 289 [2022-01-11 03:30:01,028 INFO L226 Difference]: Without dead ends: 223 [2022-01-11 03:30:01,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:01,028 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 69 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:01,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1401 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-11 03:30:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-01-11 03:30:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 222 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 268 transitions. [2022-01-11 03:30:01,056 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 268 transitions. Word has length 62 [2022-01-11 03:30:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:01,056 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 268 transitions. [2022-01-11 03:30:01,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 268 transitions. [2022-01-11 03:30:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-11 03:30:01,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:01,057 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:01,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-11 03:30:01,057 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2019794455, now seen corresponding path program 1 times [2022-01-11 03:30:01,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122030415] [2022-01-11 03:30:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:01,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:01,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122030415] [2022-01-11 03:30:01,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122030415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:01,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:01,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:30:01,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205643463] [2022-01-11 03:30:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:01,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:30:01,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:30:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:01,156 INFO L87 Difference]: Start difference. First operand 223 states and 268 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:01,411 INFO L93 Difference]: Finished difference Result 377 states and 442 transitions. [2022-01-11 03:30:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-01-11 03:30:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:01,412 INFO L225 Difference]: With dead ends: 377 [2022-01-11 03:30:01,413 INFO L226 Difference]: Without dead ends: 355 [2022-01-11 03:30:01,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-11 03:30:01,414 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 513 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:01,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1597 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-01-11 03:30:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 226. [2022-01-11 03:30:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 1.2098214285714286) internal successors, (271), 225 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 271 transitions. [2022-01-11 03:30:01,459 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 271 transitions. Word has length 63 [2022-01-11 03:30:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:01,459 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 271 transitions. [2022-01-11 03:30:01,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 271 transitions. [2022-01-11 03:30:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-11 03:30:01,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:01,460 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:01,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-11 03:30:01,460 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:01,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1824193868, now seen corresponding path program 1 times [2022-01-11 03:30:01,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:01,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739970283] [2022-01-11 03:30:01,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:01,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:01,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739970283] [2022-01-11 03:30:01,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739970283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:01,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:01,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:01,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089869224] [2022-01-11 03:30:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:01,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:01,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:01,503 INFO L87 Difference]: Start difference. First operand 226 states and 271 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:01,573 INFO L93 Difference]: Finished difference Result 418 states and 510 transitions. [2022-01-11 03:30:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-01-11 03:30:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:01,574 INFO L225 Difference]: With dead ends: 418 [2022-01-11 03:30:01,574 INFO L226 Difference]: Without dead ends: 280 [2022-01-11 03:30:01,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:01,575 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 130 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:01,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 351 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-01-11 03:30:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 226. [2022-01-11 03:30:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 1.2008928571428572) internal successors, (269), 225 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2022-01-11 03:30:01,615 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 64 [2022-01-11 03:30:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:01,616 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2022-01-11 03:30:01,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2022-01-11 03:30:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 03:30:01,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:01,617 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:01,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-11 03:30:01,617 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash -63405258, now seen corresponding path program 1 times [2022-01-11 03:30:01,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388413062] [2022-01-11 03:30:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:01,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:01,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388413062] [2022-01-11 03:30:01,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388413062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:01,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:01,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:30:01,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599608559] [2022-01-11 03:30:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:01,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:01,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:01,676 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:01,827 INFO L93 Difference]: Finished difference Result 401 states and 483 transitions. [2022-01-11 03:30:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:01,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-01-11 03:30:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:01,829 INFO L225 Difference]: With dead ends: 401 [2022-01-11 03:30:01,829 INFO L226 Difference]: Without dead ends: 333 [2022-01-11 03:30:01,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:30:01,829 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 539 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:01,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 884 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-01-11 03:30:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 180. [2022-01-11 03:30:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.2191011235955056) internal successors, (217), 179 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 217 transitions. [2022-01-11 03:30:01,876 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 217 transitions. Word has length 65 [2022-01-11 03:30:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:01,877 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 217 transitions. [2022-01-11 03:30:01,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 217 transitions. [2022-01-11 03:30:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 03:30:01,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:01,877 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:01,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-11 03:30:01,878 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1268951914, now seen corresponding path program 1 times [2022-01-11 03:30:01,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179433852] [2022-01-11 03:30:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:01,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:01,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:01,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179433852] [2022-01-11 03:30:01,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179433852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:01,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:01,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:30:01,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591591833] [2022-01-11 03:30:01,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:01,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:30:01,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:30:01,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:30:01,949 INFO L87 Difference]: Start difference. First operand 180 states and 217 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:02,026 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2022-01-11 03:30:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:30:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 03:30:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:02,027 INFO L225 Difference]: With dead ends: 254 [2022-01-11 03:30:02,027 INFO L226 Difference]: Without dead ends: 230 [2022-01-11 03:30:02,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:02,028 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 80 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:02,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 474 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-11 03:30:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 181. [2022-01-11 03:30:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.217877094972067) internal successors, (218), 180 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2022-01-11 03:30:02,069 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 68 [2022-01-11 03:30:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:02,069 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2022-01-11 03:30:02,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2022-01-11 03:30:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-11 03:30:02,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:02,070 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:02,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-11 03:30:02,070 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1871404256, now seen corresponding path program 1 times [2022-01-11 03:30:02,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:02,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451431165] [2022-01-11 03:30:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:02,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:02,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:02,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451431165] [2022-01-11 03:30:02,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451431165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:02,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:02,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:02,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089118716] [2022-01-11 03:30:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:02,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:02,129 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:02,203 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-01-11 03:30:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-01-11 03:30:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:02,204 INFO L225 Difference]: With dead ends: 242 [2022-01-11 03:30:02,204 INFO L226 Difference]: Without dead ends: 218 [2022-01-11 03:30:02,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:02,205 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 51 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:02,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 298 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-01-11 03:30:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2022-01-11 03:30:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.2209944751381216) internal successors, (221), 182 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 221 transitions. [2022-01-11 03:30:02,246 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 221 transitions. Word has length 73 [2022-01-11 03:30:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:02,246 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 221 transitions. [2022-01-11 03:30:02,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 221 transitions. [2022-01-11 03:30:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-11 03:30:02,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:02,248 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:02,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-11 03:30:02,248 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1730169619, now seen corresponding path program 1 times [2022-01-11 03:30:02,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230436073] [2022-01-11 03:30:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:02,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:02,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:02,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230436073] [2022-01-11 03:30:02,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230436073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:02,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:02,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:30:02,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987937348] [2022-01-11 03:30:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:02,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:30:02,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:30:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:30:02,325 INFO L87 Difference]: Start difference. First operand 183 states and 221 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:02,399 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2022-01-11 03:30:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:30:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-01-11 03:30:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:02,400 INFO L225 Difference]: With dead ends: 247 [2022-01-11 03:30:02,401 INFO L226 Difference]: Without dead ends: 221 [2022-01-11 03:30:02,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:02,401 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 34 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:02,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 510 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-11 03:30:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 187. [2022-01-11 03:30:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 1.2162162162162162) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-01-11 03:30:02,442 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 75 [2022-01-11 03:30:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:02,443 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-01-11 03:30:02,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-01-11 03:30:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-11 03:30:02,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:02,443 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:02,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-11 03:30:02,444 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 65516339, now seen corresponding path program 1 times [2022-01-11 03:30:02,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286312180] [2022-01-11 03:30:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:02,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:02,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:02,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286312180] [2022-01-11 03:30:02,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286312180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:02,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:02,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:30:02,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692116148] [2022-01-11 03:30:02,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:02,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:30:02,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:30:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:02,569 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:02,681 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2022-01-11 03:30:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:30:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-01-11 03:30:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:02,682 INFO L225 Difference]: With dead ends: 275 [2022-01-11 03:30:02,682 INFO L226 Difference]: Without dead ends: 219 [2022-01-11 03:30:02,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:02,683 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 187 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:02,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 752 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-01-11 03:30:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2022-01-11 03:30:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.1689189189189189) internal successors, (173), 148 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-01-11 03:30:02,712 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 75 [2022-01-11 03:30:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:02,712 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-01-11 03:30:02,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-01-11 03:30:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-11 03:30:02,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:02,713 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:02,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-11 03:30:02,713 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -879291225, now seen corresponding path program 1 times [2022-01-11 03:30:02,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:02,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137179315] [2022-01-11 03:30:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:02,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:02,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:02,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137179315] [2022-01-11 03:30:02,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137179315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:02,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:02,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 03:30:02,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128735771] [2022-01-11 03:30:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:02,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 03:30:02,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 03:30:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:30:02,800 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:03,017 INFO L93 Difference]: Finished difference Result 410 states and 478 transitions. [2022-01-11 03:30:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 03:30:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-01-11 03:30:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:03,019 INFO L225 Difference]: With dead ends: 410 [2022-01-11 03:30:03,019 INFO L226 Difference]: Without dead ends: 390 [2022-01-11 03:30:03,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-11 03:30:03,019 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 593 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:03,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 1126 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-01-11 03:30:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 158. [2022-01-11 03:30:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.1656050955414012) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-01-11 03:30:03,070 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 78 [2022-01-11 03:30:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:03,070 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-01-11 03:30:03,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-01-11 03:30:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 03:30:03,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:03,071 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:03,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-11 03:30:03,071 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1179647823, now seen corresponding path program 1 times [2022-01-11 03:30:03,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:03,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151092782] [2022-01-11 03:30:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:03,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:03,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:03,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151092782] [2022-01-11 03:30:03,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151092782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:03,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:03,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-11 03:30:03,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075884000] [2022-01-11 03:30:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:03,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-11 03:30:03,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-11 03:30:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:30:03,191 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:03,552 INFO L93 Difference]: Finished difference Result 374 states and 439 transitions. [2022-01-11 03:30:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 03:30:03,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-01-11 03:30:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:03,553 INFO L225 Difference]: With dead ends: 374 [2022-01-11 03:30:03,554 INFO L226 Difference]: Without dead ends: 300 [2022-01-11 03:30:03,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2022-01-11 03:30:03,554 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 392 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:03,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 2558 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-11 03:30:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 158. [2022-01-11 03:30:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.1592356687898089) internal successors, (182), 157 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2022-01-11 03:30:03,594 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 79 [2022-01-11 03:30:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:03,594 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2022-01-11 03:30:03,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-01-11 03:30:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 03:30:03,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:03,595 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:03,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-11 03:30:03,595 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1845080408, now seen corresponding path program 1 times [2022-01-11 03:30:03,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:03,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433873003] [2022-01-11 03:30:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:03,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:03,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:03,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433873003] [2022-01-11 03:30:03,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433873003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:03,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:03,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-11 03:30:03,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897894757] [2022-01-11 03:30:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:03,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 03:30:03,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:03,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 03:30:03,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:30:03,706 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:03,956 INFO L93 Difference]: Finished difference Result 411 states and 477 transitions. [2022-01-11 03:30:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 03:30:03,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-11 03:30:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:03,957 INFO L225 Difference]: With dead ends: 411 [2022-01-11 03:30:03,957 INFO L226 Difference]: Without dead ends: 287 [2022-01-11 03:30:03,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-01-11 03:30:03,958 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 221 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:03,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 1625 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-11 03:30:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2022-01-11 03:30:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.131578947368421) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2022-01-11 03:30:04,016 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 84 [2022-01-11 03:30:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,016 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2022-01-11 03:30:04,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-01-11 03:30:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 03:30:04,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,017 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-11 03:30:04,017 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1273829175, now seen corresponding path program 1 times [2022-01-11 03:30:04,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635907501] [2022-01-11 03:30:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:04,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635907501] [2022-01-11 03:30:04,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635907501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 03:30:04,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088955331] [2022-01-11 03:30:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:30:04,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:30:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:30:04,099 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,296 INFO L93 Difference]: Finished difference Result 424 states and 487 transitions. [2022-01-11 03:30:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 03:30:04,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-11 03:30:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,297 INFO L225 Difference]: With dead ends: 424 [2022-01-11 03:30:04,298 INFO L226 Difference]: Without dead ends: 404 [2022-01-11 03:30:04,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-11 03:30:04,298 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 321 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 1431 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-11 03:30:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 226. [2022-01-11 03:30:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.1288888888888888) internal successors, (254), 225 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2022-01-11 03:30:04,349 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 84 [2022-01-11 03:30:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,349 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2022-01-11 03:30:04,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2022-01-11 03:30:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 03:30:04,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,350 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-11 03:30:04,350 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -818304445, now seen corresponding path program 1 times [2022-01-11 03:30:04,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195445075] [2022-01-11 03:30:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:04,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195445075] [2022-01-11 03:30:04,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195445075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:30:04,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685210581] [2022-01-11 03:30:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:30:04,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:30:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:04,437 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,556 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2022-01-11 03:30:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-11 03:30:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,557 INFO L225 Difference]: With dead ends: 261 [2022-01-11 03:30:04,557 INFO L226 Difference]: Without dead ends: 224 [2022-01-11 03:30:04,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:04,557 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 400 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 764 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-01-11 03:30:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-01-11 03:30:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.1210762331838564) internal successors, (250), 223 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 250 transitions. [2022-01-11 03:30:04,605 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 250 transitions. Word has length 90 [2022-01-11 03:30:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,606 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 250 transitions. [2022-01-11 03:30:04,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 250 transitions. [2022-01-11 03:30:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 03:30:04,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,606 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-11 03:30:04,606 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1787209314, now seen corresponding path program 1 times [2022-01-11 03:30:04,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814173861] [2022-01-11 03:30:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:04,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814173861] [2022-01-11 03:30:04,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814173861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:30:04,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703412798] [2022-01-11 03:30:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:30:04,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:30:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:30:04,678 INFO L87 Difference]: Start difference. First operand 224 states and 250 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:04,756 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2022-01-11 03:30:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:30:04,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-11 03:30:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:04,760 INFO L225 Difference]: With dead ends: 304 [2022-01-11 03:30:04,760 INFO L226 Difference]: Without dead ends: 261 [2022-01-11 03:30:04,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:04,761 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:04,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 471 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-01-11 03:30:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 226. [2022-01-11 03:30:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.12) internal successors, (252), 225 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2022-01-11 03:30:04,808 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 90 [2022-01-11 03:30:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:04,808 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2022-01-11 03:30:04,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2022-01-11 03:30:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 03:30:04,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:04,809 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:04,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-11 03:30:04,809 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -258980222, now seen corresponding path program 1 times [2022-01-11 03:30:04,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:04,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017673937] [2022-01-11 03:30:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:04,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:04,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:04,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017673937] [2022-01-11 03:30:04,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017673937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:04,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:04,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:30:04,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082233107] [2022-01-11 03:30:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:04,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:30:04,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:30:04,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:04,899 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,052 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2022-01-11 03:30:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 03:30:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-11 03:30:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,053 INFO L225 Difference]: With dead ends: 284 [2022-01-11 03:30:05,053 INFO L226 Difference]: Without dead ends: 230 [2022-01-11 03:30:05,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:05,054 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 77 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1047 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 [2022-01-11 03:30:05,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1047 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-11 03:30:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2022-01-11 03:30:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.1071428571428572) internal successors, (248), 224 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 248 transitions. [2022-01-11 03:30:05,091 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 248 transitions. Word has length 90 [2022-01-11 03:30:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,091 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 248 transitions. [2022-01-11 03:30:05,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 248 transitions. [2022-01-11 03:30:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-11 03:30:05,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,092 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-11 03:30:05,092 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 480751571, now seen corresponding path program 1 times [2022-01-11 03:30:05,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776757848] [2022-01-11 03:30:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:05,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776757848] [2022-01-11 03:30:05,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776757848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-11 03:30:05,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160811172] [2022-01-11 03:30:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-11 03:30:05,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-11 03:30:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-11 03:30:05,203 INFO L87 Difference]: Start difference. First operand 225 states and 248 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,532 INFO L93 Difference]: Finished difference Result 500 states and 558 transitions. [2022-01-11 03:30:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-11 03:30:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-01-11 03:30:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,533 INFO L225 Difference]: With dead ends: 500 [2022-01-11 03:30:05,533 INFO L226 Difference]: Without dead ends: 465 [2022-01-11 03:30:05,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2022-01-11 03:30:05,534 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 1416 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1416 Valid, 1128 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-11 03:30:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 232. [2022-01-11 03:30:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.1125541125541125) internal successors, (257), 231 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2022-01-11 03:30:05,575 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 91 [2022-01-11 03:30:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,575 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2022-01-11 03:30:05,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2022-01-11 03:30:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-11 03:30:05,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,576 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-11 03:30:05,576 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1643771459, now seen corresponding path program 1 times [2022-01-11 03:30:05,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733825621] [2022-01-11 03:30:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:05,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733825621] [2022-01-11 03:30:05,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733825621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 03:30:05,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030390067] [2022-01-11 03:30:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:30:05,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:30:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:30:05,665 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:05,801 INFO L93 Difference]: Finished difference Result 267 states and 295 transitions. [2022-01-11 03:30:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:30:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-01-11 03:30:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:05,802 INFO L225 Difference]: With dead ends: 267 [2022-01-11 03:30:05,802 INFO L226 Difference]: Without dead ends: 145 [2022-01-11 03:30:05,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 03:30:05,803 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 390 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:05,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 739 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-11 03:30:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2022-01-11 03:30:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.108695652173913) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2022-01-11 03:30:05,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 95 [2022-01-11 03:30:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:05,839 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2022-01-11 03:30:05,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-01-11 03:30:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-11 03:30:05,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:05,840 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:05,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-01-11 03:30:05,841 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2022-01-11 03:30:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 543577923, now seen corresponding path program 1 times [2022-01-11 03:30:05,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325080517] [2022-01-11 03:30:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:05,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:05,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:05,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325080517] [2022-01-11 03:30:05,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325080517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:05,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:05,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-11 03:30:05,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152937115] [2022-01-11 03:30:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:05,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 03:30:05,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 03:30:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-11 03:30:05,966 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:06,160 INFO L93 Difference]: Finished difference Result 181 states and 200 transitions. [2022-01-11 03:30:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 03:30:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-01-11 03:30:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:06,161 INFO L225 Difference]: With dead ends: 181 [2022-01-11 03:30:06,161 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:06,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-01-11 03:30:06,162 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 491 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:06,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 823 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:06,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2022-01-11 03:30:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:06,162 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:06,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:06,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:06,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (52 of 53 remaining) [2022-01-11 03:30:06,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (51 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (50 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (49 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (48 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (47 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (46 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (45 of 53 remaining) [2022-01-11 03:30:06,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (44 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (43 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (42 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (41 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (40 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (39 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (38 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (37 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (36 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (35 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (34 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (33 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (32 of 53 remaining) [2022-01-11 03:30:06,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (31 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (30 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (29 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (28 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (27 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (26 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (25 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (24 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (23 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (22 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (21 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (20 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (19 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (18 of 53 remaining) [2022-01-11 03:30:06,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (17 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (16 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (15 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (14 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (13 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (12 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (11 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (9 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (8 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (7 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (6 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (5 of 53 remaining) [2022-01-11 03:30:06,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (4 of 53 remaining) [2022-01-11 03:30:06,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (3 of 53 remaining) [2022-01-11 03:30:06,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (2 of 53 remaining) [2022-01-11 03:30:06,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 53 remaining) [2022-01-11 03:30:06,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 53 remaining) [2022-01-11 03:30:06,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-01-11 03:30:06,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.