/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/bitvector/s3_clnt_2.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:55:00,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:55:00,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:55:00,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:55:00,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:55:00,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:55:00,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:55:00,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:55:00,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:55:00,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:55:00,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:55:00,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:55:00,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:55:00,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:55:00,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:55:00,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:55:00,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:55:00,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:55:00,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:55:00,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:55:00,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:55:00,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:55:00,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:55:00,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:55:00,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:55:00,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:55:00,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:55:00,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:55:00,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:55:00,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:55:00,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:55:00,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:55:00,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:55:00,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:55:00,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:55:00,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:55:00,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:55:00,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:55:00,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:55:00,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:55:00,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:55:00,104 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 01:55:00,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:55:00,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:55:00,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:55:00,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:55:00,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:55:00,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:55:00,127 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:55:00,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:55:00,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:55:00,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:55:00,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:55:00,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:55:00,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:55:00,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:55:00,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:55:00,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:55:00,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:55:00,131 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:55:00,131 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 01:55:00,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:55:00,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:55:00,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:55:00,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:55:00,307 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:55:00,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2022-01-11 01:55:00,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7824a0944/28cd8ea1ac2e4bf49ad10294fdf3bb22/FLAG75620b3e0 [2022-01-11 01:55:00,695 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:55:00,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2022-01-11 01:55:00,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7824a0944/28cd8ea1ac2e4bf49ad10294fdf3bb22/FLAG75620b3e0 [2022-01-11 01:55:01,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7824a0944/28cd8ea1ac2e4bf49ad10294fdf3bb22 [2022-01-11 01:55:01,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:55:01,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:55:01,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:55:01,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:55:01,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:55:01,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6126c6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01, skipping insertion in model container [2022-01-11 01:55:01,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:55:01,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:55:01,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2022-01-11 01:55:01,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:55:01,355 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:55:01,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2022-01-11 01:55:01,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:55:01,397 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:55:01,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01 WrapperNode [2022-01-11 01:55:01,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:55:01,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:55:01,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:55:01,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:55:01,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,426 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 436 [2022-01-11 01:55:01,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:55:01,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:55:01,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:55:01,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:55:01,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:55:01,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:55:01,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:55:01,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:55:01,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:01,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:55:01,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:01,481 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 01:55:01,506 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 01:55:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:55:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:55:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:55:01,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:55:01,598 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:55:01,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:55:01,608 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 01:55:01,955 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-11 01:55:01,955 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-11 01:55:01,955 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:55:01,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:55:01,969 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 01:55:01,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:01 BoogieIcfgContainer [2022-01-11 01:55:01,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:55:01,971 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:55:01,971 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:55:01,971 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:55:01,974 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:01" (1/1) ... [2022-01-11 01:55:02,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:55:02 BasicIcfg [2022-01-11 01:55:02,089 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:55:02,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:55:02,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:55:02,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:55:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:55:01" (1/4) ... [2022-01-11 01:55:02,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:55:02, skipping insertion in model container [2022-01-11 01:55:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:55:01" (2/4) ... [2022-01-11 01:55:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:55:02, skipping insertion in model container [2022-01-11 01:55:02,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:55:01" (3/4) ... [2022-01-11 01:55:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:55:02, skipping insertion in model container [2022-01-11 01:55:02,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:55:02" (4/4) ... [2022-01-11 01:55:02,095 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.cTransformedIcfg [2022-01-11 01:55:02,098 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:55:02,098 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 01:55:02,126 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:55:02,137 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 01:55:02,137 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 01:55:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 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 01:55:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 01:55:02,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:02,152 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] [2022-01-11 01:55:02,152 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1307823906, now seen corresponding path program 1 times [2022-01-11 01:55:02,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:02,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282569949] [2022-01-11 01:55:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:02,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:02,321 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 01:55:02,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282569949] [2022-01-11 01:55:02,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282569949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:02,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:02,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:02,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207478611] [2022-01-11 01:55:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:02,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:02,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:02,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:02,353 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 01:55:04,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:06,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:06,598 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2022-01-11 01:55:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 01:55:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:06,608 INFO L225 Difference]: With dead ends: 246 [2022-01-11 01:55:06,608 INFO L226 Difference]: Without dead ends: 112 [2022-01-11 01:55:06,610 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 01:55:06,616 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:06,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-11 01:55:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-01-11 01:55:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 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 01:55:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2022-01-11 01:55:06,643 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2022-01-11 01:55:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:06,643 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2022-01-11 01:55:06,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 01:55:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2022-01-11 01:55:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:55:06,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:06,645 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-01-11 01:55:06,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:55:06,645 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash 421629983, now seen corresponding path program 1 times [2022-01-11 01:55:06,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:06,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535183607] [2022-01-11 01:55:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:06,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:55:06,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:06,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535183607] [2022-01-11 01:55:06,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535183607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:06,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:06,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:06,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360481607] [2022-01-11 01:55:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:06,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:06,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:06,699 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 01:55:08,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:10,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:10,971 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2022-01-11 01:55:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 01:55:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:10,973 INFO L225 Difference]: With dead ends: 233 [2022-01-11 01:55:10,973 INFO L226 Difference]: Without dead ends: 131 [2022-01-11 01:55:10,973 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 01:55:10,974 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:10,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 238 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-01-11 01:55:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-01-11 01:55:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 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 01:55:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2022-01-11 01:55:10,982 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2022-01-11 01:55:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:10,982 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2022-01-11 01:55:10,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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 01:55:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2022-01-11 01:55:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-11 01:55:10,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:10,985 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:10,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:55:10,985 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -581055946, now seen corresponding path program 1 times [2022-01-11 01:55:10,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:10,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541087606] [2022-01-11 01:55:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:10,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 01:55:11,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:11,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541087606] [2022-01-11 01:55:11,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541087606] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:11,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:11,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:11,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811890466] [2022-01-11 01:55:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:11,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:11,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:11,040 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:13,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:15,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:15,263 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2022-01-11 01:55:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-01-11 01:55:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:15,265 INFO L225 Difference]: With dead ends: 265 [2022-01-11 01:55:15,265 INFO L226 Difference]: Without dead ends: 148 [2022-01-11 01:55:15,265 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 01:55:15,266 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:15,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-01-11 01:55:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-01-11 01:55:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 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 01:55:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2022-01-11 01:55:15,272 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2022-01-11 01:55:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:15,273 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2022-01-11 01:55:15,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2022-01-11 01:55:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 01:55:15,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:15,274 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-11 01:55:15,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:55:15,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1385783717, now seen corresponding path program 1 times [2022-01-11 01:55:15,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:15,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297446289] [2022-01-11 01:55:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:15,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 01:55:15,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297446289] [2022-01-11 01:55:15,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297446289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:15,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:15,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:15,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091121678] [2022-01-11 01:55:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:15,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:15,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:15,357 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 01:55:17,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:19,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:19,591 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2022-01-11 01:55:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 67 [2022-01-11 01:55:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:19,593 INFO L225 Difference]: With dead ends: 328 [2022-01-11 01:55:19,593 INFO L226 Difference]: Without dead ends: 193 [2022-01-11 01:55:19,593 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 01:55:19,594 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:19,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-11 01:55:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2022-01-11 01:55:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4184782608695652) internal successors, (261), 184 states have internal predecessors, (261), 0 states have call successors, (0), 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 01:55:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2022-01-11 01:55:19,600 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2022-01-11 01:55:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:19,601 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2022-01-11 01:55:19,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 01:55:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2022-01-11 01:55:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-11 01:55:19,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:19,604 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-11 01:55:19,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:55:19,605 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1664419098, now seen corresponding path program 1 times [2022-01-11 01:55:19,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:19,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638205799] [2022-01-11 01:55:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:19,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 01:55:19,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638205799] [2022-01-11 01:55:19,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638205799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:19,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:19,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:19,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188809958] [2022-01-11 01:55:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:19,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:19,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:19,671 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 01:55:21,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:23,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:23,886 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2022-01-11 01:55:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 67 [2022-01-11 01:55:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:23,888 INFO L225 Difference]: With dead ends: 383 [2022-01-11 01:55:23,888 INFO L226 Difference]: Without dead ends: 208 [2022-01-11 01:55:23,888 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 01:55:23,889 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:23,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 256 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-11 01:55:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2022-01-11 01:55:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 0 states have call successors, (0), 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 01:55:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2022-01-11 01:55:23,895 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2022-01-11 01:55:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:23,896 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2022-01-11 01:55:23,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 01:55:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-01-11 01:55:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 01:55:23,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:23,897 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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] [2022-01-11 01:55:23,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:55:23,897 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1169244594, now seen corresponding path program 1 times [2022-01-11 01:55:23,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:23,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113970730] [2022-01-11 01:55:23,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:23,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-11 01:55:23,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:23,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113970730] [2022-01-11 01:55:23,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113970730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:23,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:23,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:23,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606358234] [2022-01-11 01:55:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:23,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:23,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:23,945 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:26,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:28,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:28,179 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2022-01-11 01:55:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-11 01:55:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:28,180 INFO L225 Difference]: With dead ends: 422 [2022-01-11 01:55:28,180 INFO L226 Difference]: Without dead ends: 228 [2022-01-11 01:55:28,181 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 01:55:28,182 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:28,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 255 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-01-11 01:55:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-01-11 01:55:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2022-01-11 01:55:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 224 states have internal predecessors, (311), 0 states have call successors, (0), 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 01:55:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2022-01-11 01:55:28,188 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2022-01-11 01:55:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:28,188 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2022-01-11 01:55:28,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:55:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2022-01-11 01:55:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 01:55:28,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:28,190 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 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] [2022-01-11 01:55:28,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:55:28,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2122899787, now seen corresponding path program 1 times [2022-01-11 01:55:28,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:28,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778431745] [2022-01-11 01:55:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:28,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-11 01:55:28,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778431745] [2022-01-11 01:55:28,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778431745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:28,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:28,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:28,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444464504] [2022-01-11 01:55:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:28,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:28,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:28,254 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 01:55:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:28,281 INFO L93 Difference]: Finished difference Result 653 states and 904 transitions. [2022-01-11 01:55:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 103 [2022-01-11 01:55:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:28,283 INFO L225 Difference]: With dead ends: 653 [2022-01-11 01:55:28,284 INFO L226 Difference]: Without dead ends: 438 [2022-01-11 01:55:28,284 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 01:55:28,285 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 134 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:28,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 302 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-11 01:55:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2022-01-11 01:55:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.3821510297482837) internal successors, (604), 437 states have internal predecessors, (604), 0 states have call successors, (0), 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 01:55:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 604 transitions. [2022-01-11 01:55:28,296 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 604 transitions. Word has length 103 [2022-01-11 01:55:28,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:28,296 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 604 transitions. [2022-01-11 01:55:28,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 01:55:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 604 transitions. [2022-01-11 01:55:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 01:55:28,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:28,298 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 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] [2022-01-11 01:55:28,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:55:28,298 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 789125342, now seen corresponding path program 1 times [2022-01-11 01:55:28,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909875971] [2022-01-11 01:55:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:28,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-11 01:55:28,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:28,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909875971] [2022-01-11 01:55:28,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909875971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:28,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:28,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:28,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096481382] [2022-01-11 01:55:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:28,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:28,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:28,396 INFO L87 Difference]: Start difference. First operand 438 states and 604 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 01:55:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:28,421 INFO L93 Difference]: Finished difference Result 653 states and 901 transitions. [2022-01-11 01:55:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 105 [2022-01-11 01:55:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:28,424 INFO L225 Difference]: With dead ends: 653 [2022-01-11 01:55:28,424 INFO L226 Difference]: Without dead ends: 651 [2022-01-11 01:55:28,424 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 01:55:28,427 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:28,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 299 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-01-11 01:55:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2022-01-11 01:55:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.383076923076923) internal successors, (899), 650 states have internal predecessors, (899), 0 states have call successors, (0), 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 01:55:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 899 transitions. [2022-01-11 01:55:28,439 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 899 transitions. Word has length 105 [2022-01-11 01:55:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:28,440 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 899 transitions. [2022-01-11 01:55:28,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 01:55:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 899 transitions. [2022-01-11 01:55:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-01-11 01:55:28,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:28,442 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:28,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:55:28,442 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:28,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -245834299, now seen corresponding path program 1 times [2022-01-11 01:55:28,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:28,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347175640] [2022-01-11 01:55:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:28,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-01-11 01:55:28,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:28,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347175640] [2022-01-11 01:55:28,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347175640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:28,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:28,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:28,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855711358] [2022-01-11 01:55:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:28,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:28,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:28,518 INFO L87 Difference]: Start difference. First operand 651 states and 899 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 01:55:30,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:32,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:32,815 INFO L93 Difference]: Finished difference Result 1442 states and 2048 transitions. [2022-01-11 01:55:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 173 [2022-01-11 01:55:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:32,818 INFO L225 Difference]: With dead ends: 1442 [2022-01-11 01:55:32,818 INFO L226 Difference]: Without dead ends: 798 [2022-01-11 01:55:32,819 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 01:55:32,821 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 96 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 42 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:32,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 189 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 109 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-01-11 01:55:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-01-11 01:55:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 768. [2022-01-11 01:55:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.4185136897001305) internal successors, (1088), 767 states have internal predecessors, (1088), 0 states have call successors, (0), 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 01:55:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1088 transitions. [2022-01-11 01:55:32,838 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1088 transitions. Word has length 173 [2022-01-11 01:55:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:32,838 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 1088 transitions. [2022-01-11 01:55:32,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 01:55:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1088 transitions. [2022-01-11 01:55:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-11 01:55:32,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:32,840 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 01:55:32,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:55:32,841 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1714934650, now seen corresponding path program 2 times [2022-01-11 01:55:32,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525491817] [2022-01-11 01:55:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:32,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-01-11 01:55:32,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:32,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525491817] [2022-01-11 01:55:32,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525491817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:32,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:32,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:32,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362298896] [2022-01-11 01:55:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:32,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:32,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:32,882 INFO L87 Difference]: Start difference. First operand 768 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 01:55:34,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-11 01:55:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:35,034 INFO L93 Difference]: Finished difference Result 1804 states and 2629 transitions. [2022-01-11 01:55:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:35,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 185 [2022-01-11 01:55:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:35,037 INFO L225 Difference]: With dead ends: 1804 [2022-01-11 01:55:35,037 INFO L226 Difference]: Without dead ends: 995 [2022-01-11 01:55:35,039 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 01:55:35,040 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:35,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 199 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 111 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-01-11 01:55:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-01-11 01:55:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 957. [2022-01-11 01:55:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.401673640167364) internal successors, (1340), 956 states have internal predecessors, (1340), 0 states have call successors, (0), 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 01:55:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1340 transitions. [2022-01-11 01:55:35,056 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1340 transitions. Word has length 185 [2022-01-11 01:55:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:35,057 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 1340 transitions. [2022-01-11 01:55:35,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 01:55:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1340 transitions. [2022-01-11 01:55:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-11 01:55:35,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:35,059 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:35,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:55:35,059 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1524364601, now seen corresponding path program 1 times [2022-01-11 01:55:35,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:35,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747455635] [2022-01-11 01:55:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:35,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-01-11 01:55:35,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:35,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747455635] [2022-01-11 01:55:35,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747455635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:35,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:35,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:35,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696668427] [2022-01-11 01:55:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:35,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:35,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:35,184 INFO L87 Difference]: Start difference. First operand 957 states and 1340 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 01:55:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:35,215 INFO L93 Difference]: Finished difference Result 2217 states and 3103 transitions. [2022-01-11 01:55:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:35,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 194 [2022-01-11 01:55:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:35,219 INFO L225 Difference]: With dead ends: 2217 [2022-01-11 01:55:35,219 INFO L226 Difference]: Without dead ends: 1270 [2022-01-11 01:55:35,220 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 01:55:35,221 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 111 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:35,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 466 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-01-11 01:55:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2022-01-11 01:55:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.3979511426319937) internal successors, (1774), 1269 states have internal predecessors, (1774), 0 states have call successors, (0), 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 01:55:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1774 transitions. [2022-01-11 01:55:35,245 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1774 transitions. Word has length 194 [2022-01-11 01:55:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:35,245 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1774 transitions. [2022-01-11 01:55:35,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 01:55:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1774 transitions. [2022-01-11 01:55:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:55:35,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:35,248 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:35,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:55:35,248 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -854690496, now seen corresponding path program 1 times [2022-01-11 01:55:35,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563163803] [2022-01-11 01:55:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:35,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-11 01:55:35,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:35,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563163803] [2022-01-11 01:55:35,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563163803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:55:35,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:55:35,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:55:35,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187440714] [2022-01-11 01:55:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:55:35,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:55:35,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:55:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:55:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:55:35,368 INFO L87 Difference]: Start difference. First operand 1270 states and 1774 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 01:55:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:55:35,411 INFO L93 Difference]: Finished difference Result 3542 states and 4990 transitions. [2022-01-11 01:55:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:55:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 196 [2022-01-11 01:55:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:55:35,418 INFO L225 Difference]: With dead ends: 3542 [2022-01-11 01:55:35,418 INFO L226 Difference]: Without dead ends: 2282 [2022-01-11 01:55:35,419 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 01:55:35,420 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 105 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:55:35,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 439 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:55:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2022-01-11 01:55:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2022-01-11 01:55:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 1.4115840280824923) internal successors, (3217), 2279 states have internal predecessors, (3217), 0 states have call successors, (0), 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 01:55:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3217 transitions. [2022-01-11 01:55:35,474 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3217 transitions. Word has length 196 [2022-01-11 01:55:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:55:35,475 INFO L470 AbstractCegarLoop]: Abstraction has 2280 states and 3217 transitions. [2022-01-11 01:55:35,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 01:55:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3217 transitions. [2022-01-11 01:55:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:55:35,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:55:35,478 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-11 01:55:35,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:55:35,478 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:55:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:55:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -5831807, now seen corresponding path program 1 times [2022-01-11 01:55:35,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:55:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063068050] [2022-01-11 01:55:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:35,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:55:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:55:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-01-11 01:55:37,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:55:37,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063068050] [2022-01-11 01:55:37,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063068050] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:55:37,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264484551] [2022-01-11 01:55:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:55:37,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:55:37,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:55:37,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:55:37,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process