/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_BITWISE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:49:34,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:49:34,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:49:34,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:49:34,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:49:34,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:49:34,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:49:34,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:49:34,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:49:34,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:49:34,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:49:34,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:49:34,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:49:34,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:49:34,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:49:34,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:49:34,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:49:34,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:49:34,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:49:34,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:49:34,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:49:34,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:49:34,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:49:34,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:49:34,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:49:34,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:49:34,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:49:34,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:49:34,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:49:34,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:49:34,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:49:34,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:49:34,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:49:34,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:49:34,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:49:34,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:49:34,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:49:34,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:49:34,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:49:34,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:49:34,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:49:34,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:49:34,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:49:34,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:49:34,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:49:34,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:49:34,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:49:34,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:49:34,260 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:49:34,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:49:34,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:49:34,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:49:34,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:49:34,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:49:34,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:49:34,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:49:34,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:49:34,263 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:49:34,264 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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-10 12:49:34,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:49:34,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:49:34,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:49:34,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:49:34,499 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:49:34,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-01-10 12:49:34,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80777e02a/9106e2fb56044949ac4269b25a21b9e3/FLAG80b1abf4f [2022-01-10 12:49:34,953 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:49:34,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-01-10 12:49:34,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80777e02a/9106e2fb56044949ac4269b25a21b9e3/FLAG80b1abf4f [2022-01-10 12:49:34,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80777e02a/9106e2fb56044949ac4269b25a21b9e3 [2022-01-10 12:49:34,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:49:34,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:49:34,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:49:34,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:49:34,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:49:34,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:34" (1/1) ... [2022-01-10 12:49:34,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8814c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:34, skipping insertion in model container [2022-01-10 12:49:34,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:34" (1/1) ... [2022-01-10 12:49:34,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:49:35,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:49:35,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2022-01-10 12:49:35,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:49:35,229 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:49:35,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2022-01-10 12:49:35,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:49:35,328 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:49:35,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35 WrapperNode [2022-01-10 12:49:35,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:49:35,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:49:35,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:49:35,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:49:35,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,391 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 957 [2022-01-10 12:49:35,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:49:35,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:49:35,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:49:35,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:49:35,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:49:35,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:49:35,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:49:35,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:49:35,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (1/1) ... [2022-01-10 12:49:35,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:49:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:49:35,479 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-10 12:49:35,487 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-10 12:49:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:49:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:49:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:49:35,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:49:35,650 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:49:35,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:49:36,355 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:49:36,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:49:36,375 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 12:49:36,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:36 BoogieIcfgContainer [2022-01-10 12:49:36,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:49:36,377 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:49:36,377 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:49:36,378 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:49:36,380 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:36" (1/1) ... [2022-01-10 12:49:36,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:49:36 BasicIcfg [2022-01-10 12:49:36,838 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:49:36,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:49:36,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:49:36,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:49:36,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:49:34" (1/4) ... [2022-01-10 12:49:36,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57925991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:36, skipping insertion in model container [2022-01-10 12:49:36,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:35" (2/4) ... [2022-01-10 12:49:36,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57925991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:36, skipping insertion in model container [2022-01-10 12:49:36,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:36" (3/4) ... [2022-01-10 12:49:36,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57925991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:49:36, skipping insertion in model container [2022-01-10 12:49:36,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:49:36" (4/4) ... [2022-01-10 12:49:36,845 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.cTransformedIcfg [2022-01-10 12:49:36,849 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:49:36,849 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 12:49:36,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:49:36,900 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-10 12:49:36,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 12:49:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 310 states have (on average 1.8) internal successors, (558), 311 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 12:49:36,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:36,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:36,937 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1230624411, now seen corresponding path program 1 times [2022-01-10 12:49:36,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:36,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369004240] [2022-01-10 12:49:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:36,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:37,396 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-10 12:49:37,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369004240] [2022-01-10 12:49:37,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369004240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:37,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:37,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:49:37,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735015164] [2022-01-10 12:49:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:37,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:49:37,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:49:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:37,432 INFO L87 Difference]: Start difference. First operand has 312 states, 310 states have (on average 1.8) internal successors, (558), 311 states have internal predecessors, (558), 0 states have call successors, (0), 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 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:37,549 INFO L93 Difference]: Finished difference Result 444 states and 782 transitions. [2022-01-10 12:49:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:49:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-01-10 12:49:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:37,568 INFO L225 Difference]: With dead ends: 444 [2022-01-10 12:49:37,569 INFO L226 Difference]: Without dead ends: 308 [2022-01-10 12:49:37,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:49:37,578 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 3 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:37,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 2175 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:49:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-01-10 12:49:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-01-10 12:49:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.6840390879478828) internal successors, (517), 307 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 517 transitions. [2022-01-10 12:49:37,631 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 517 transitions. Word has length 77 [2022-01-10 12:49:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:37,632 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 517 transitions. [2022-01-10 12:49:37,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 517 transitions. [2022-01-10 12:49:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 12:49:37,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:37,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:37,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:49:37,635 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 37968339, now seen corresponding path program 1 times [2022-01-10 12:49:37,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:37,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816892965] [2022-01-10 12:49:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:37,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:37,930 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-10 12:49:37,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:37,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816892965] [2022-01-10 12:49:37,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816892965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:37,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:37,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:37,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027610763] [2022-01-10 12:49:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:37,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:37,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:37,934 INFO L87 Difference]: Start difference. First operand 308 states and 517 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:39,965 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-10 12:49:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:40,189 INFO L93 Difference]: Finished difference Result 544 states and 921 transitions. [2022-01-10 12:49:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-10 12:49:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:40,192 INFO L225 Difference]: With dead ends: 544 [2022-01-10 12:49:40,192 INFO L226 Difference]: Without dead ends: 420 [2022-01-10 12:49:40,193 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-10 12:49:40,194 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 183 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:40,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 990 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 12:49:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-01-10 12:49:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2022-01-10 12:49:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.683453237410072) internal successors, (702), 417 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 702 transitions. [2022-01-10 12:49:40,208 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 702 transitions. Word has length 110 [2022-01-10 12:49:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:40,208 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 702 transitions. [2022-01-10 12:49:40,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 702 transitions. [2022-01-10 12:49:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 12:49:40,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:40,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:40,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:49:40,211 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 564801523, now seen corresponding path program 1 times [2022-01-10 12:49:40,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546047305] [2022-01-10 12:49:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:40,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:40,432 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-10 12:49:40,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546047305] [2022-01-10 12:49:40,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546047305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:40,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:40,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:49:40,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092457338] [2022-01-10 12:49:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:40,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:49:40,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:49:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:49:40,439 INFO L87 Difference]: Start difference. First operand 418 states and 702 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:40,540 INFO L93 Difference]: Finished difference Result 1190 states and 1991 transitions. [2022-01-10 12:49:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:49:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2022-01-10 12:49:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:40,545 INFO L225 Difference]: With dead ends: 1190 [2022-01-10 12:49:40,545 INFO L226 Difference]: Without dead ends: 819 [2022-01-10 12:49:40,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:40,547 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 1414 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:40,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1414 Valid, 985 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:49:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-01-10 12:49:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2022-01-10 12:49:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.6727941176470589) internal successors, (1365), 816 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1365 transitions. [2022-01-10 12:49:40,577 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1365 transitions. Word has length 113 [2022-01-10 12:49:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:40,577 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1365 transitions. [2022-01-10 12:49:40,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1365 transitions. [2022-01-10 12:49:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 12:49:40,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:40,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:40,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:49:40,587 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1162343895, now seen corresponding path program 1 times [2022-01-10 12:49:40,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:40,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866272161] [2022-01-10 12:49:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:40,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:49:40,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866272161] [2022-01-10 12:49:40,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866272161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:40,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:40,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:40,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800568052] [2022-01-10 12:49:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:40,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:40,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:40,752 INFO L87 Difference]: Start difference. First operand 817 states and 1365 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:42,804 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-10 12:49:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:42,927 INFO L93 Difference]: Finished difference Result 1260 states and 2125 transitions. [2022-01-10 12:49:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-01-10 12:49:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:42,932 INFO L225 Difference]: With dead ends: 1260 [2022-01-10 12:49:42,932 INFO L226 Difference]: Without dead ends: 1018 [2022-01-10 12:49:42,933 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-10 12:49:42,934 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 192 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:42,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 1152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 12:49:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-01-10 12:49:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2022-01-10 12:49:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 1.6788177339901478) internal successors, (1704), 1015 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1704 transitions. [2022-01-10 12:49:42,958 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1704 transitions. Word has length 114 [2022-01-10 12:49:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:42,958 INFO L470 AbstractCegarLoop]: Abstraction has 1016 states and 1704 transitions. [2022-01-10 12:49:42,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1704 transitions. [2022-01-10 12:49:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 12:49:42,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:42,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:42,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:49:42,960 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:42,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 449979294, now seen corresponding path program 1 times [2022-01-10 12:49:42,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881492186] [2022-01-10 12:49:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:42,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:43,112 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-10 12:49:43,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881492186] [2022-01-10 12:49:43,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881492186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:43,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:43,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:43,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750141211] [2022-01-10 12:49:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:43,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:43,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:43,114 INFO L87 Difference]: Start difference. First operand 1016 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:43,166 INFO L93 Difference]: Finished difference Result 1895 states and 3207 transitions. [2022-01-10 12:49:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-01-10 12:49:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:43,171 INFO L225 Difference]: With dead ends: 1895 [2022-01-10 12:49:43,171 INFO L226 Difference]: Without dead ends: 1242 [2022-01-10 12:49:43,172 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-10 12:49:43,174 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 200 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:43,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1014 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-01-10 12:49:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1226. [2022-01-10 12:49:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1225 states have (on average 1.68) internal successors, (2058), 1225 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2058 transitions. [2022-01-10 12:49:43,203 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2058 transitions. Word has length 114 [2022-01-10 12:49:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:43,206 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 2058 transitions. [2022-01-10 12:49:43,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2058 transitions. [2022-01-10 12:49:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 12:49:43,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:43,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:43,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:49:43,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 730591288, now seen corresponding path program 1 times [2022-01-10 12:49:43,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649923950] [2022-01-10 12:49:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:43,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:43,372 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-10 12:49:43,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:43,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649923950] [2022-01-10 12:49:43,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649923950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:43,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:43,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:49:43,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414966460] [2022-01-10 12:49:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:43,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:49:43,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:49:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:43,373 INFO L87 Difference]: Start difference. First operand 1226 states and 2058 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:43,477 INFO L93 Difference]: Finished difference Result 3628 states and 6089 transitions. [2022-01-10 12:49:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:49:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-01-10 12:49:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:43,485 INFO L225 Difference]: With dead ends: 3628 [2022-01-10 12:49:43,485 INFO L226 Difference]: Without dead ends: 2414 [2022-01-10 12:49:43,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:43,488 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 989 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:43,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [989 Valid, 1669 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:49:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-01-10 12:49:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2022-01-10 12:49:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 2411 states have (on average 1.6694317710493571) internal successors, (4025), 2411 states have internal predecessors, (4025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4025 transitions. [2022-01-10 12:49:43,570 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4025 transitions. Word has length 115 [2022-01-10 12:49:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:43,570 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 4025 transitions. [2022-01-10 12:49:43,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4025 transitions. [2022-01-10 12:49:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 12:49:43,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:43,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:43,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:49:43,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1605620515, now seen corresponding path program 1 times [2022-01-10 12:49:43,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:43,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023348053] [2022-01-10 12:49:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:43,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:43,634 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-10 12:49:43,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:43,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023348053] [2022-01-10 12:49:43,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023348053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:43,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:43,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:43,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174720311] [2022-01-10 12:49:43,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:43,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:43,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:43,637 INFO L87 Difference]: Start difference. First operand 2412 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:43,741 INFO L93 Difference]: Finished difference Result 7179 states and 11977 transitions. [2022-01-10 12:49:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2022-01-10 12:49:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:43,755 INFO L225 Difference]: With dead ends: 7179 [2022-01-10 12:49:43,755 INFO L226 Difference]: Without dead ends: 4796 [2022-01-10 12:49:43,761 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-10 12:49:43,762 INFO L933 BasicCegarLoop]: 1008 mSDtfsCounter, 495 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:43,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 1510 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2022-01-10 12:49:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 2426. [2022-01-10 12:49:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2425 states have (on average 1.6668041237113402) internal successors, (4042), 2425 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 4042 transitions. [2022-01-10 12:49:43,850 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 4042 transitions. Word has length 117 [2022-01-10 12:49:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:43,850 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 4042 transitions. [2022-01-10 12:49:43,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 4042 transitions. [2022-01-10 12:49:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 12:49:43,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:43,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:43,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:49:43,853 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1832990003, now seen corresponding path program 1 times [2022-01-10 12:49:43,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:43,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592221553] [2022-01-10 12:49:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:43,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:49:43,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592221553] [2022-01-10 12:49:43,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592221553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:43,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:43,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:49:43,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108729036] [2022-01-10 12:49:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:43,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:49:43,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:49:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:49:43,977 INFO L87 Difference]: Start difference. First operand 2426 states and 4042 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:44,177 INFO L93 Difference]: Finished difference Result 6981 states and 11625 transitions. [2022-01-10 12:49:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:49:44,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-01-10 12:49:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:44,192 INFO L225 Difference]: With dead ends: 6981 [2022-01-10 12:49:44,193 INFO L226 Difference]: Without dead ends: 4675 [2022-01-10 12:49:44,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:44,198 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 1200 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:44,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 1188 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:49:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2022-01-10 12:49:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4673. [2022-01-10 12:49:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4673 states, 4672 states have (on average 1.6568921232876712) internal successors, (7741), 4672 states have internal predecessors, (7741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 7741 transitions. [2022-01-10 12:49:44,351 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 7741 transitions. Word has length 118 [2022-01-10 12:49:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:44,351 INFO L470 AbstractCegarLoop]: Abstraction has 4673 states and 7741 transitions. [2022-01-10 12:49:44,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 7741 transitions. [2022-01-10 12:49:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 12:49:44,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:44,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:49:44,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:49:44,356 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2054996596, now seen corresponding path program 1 times [2022-01-10 12:49:44,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:44,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248195025] [2022-01-10 12:49:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:44,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:44,422 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-10 12:49:44,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:44,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248195025] [2022-01-10 12:49:44,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248195025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:44,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:44,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:49:44,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949027431] [2022-01-10 12:49:44,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:44,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:49:44,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:49:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:49:44,424 INFO L87 Difference]: Start difference. First operand 4673 states and 7741 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:44,736 INFO L93 Difference]: Finished difference Result 16627 states and 27415 transitions. [2022-01-10 12:49:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:49:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2022-01-10 12:49:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:44,771 INFO L225 Difference]: With dead ends: 16627 [2022-01-10 12:49:44,772 INFO L226 Difference]: Without dead ends: 12513 [2022-01-10 12:49:44,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:44,782 INFO L933 BasicCegarLoop]: 1175 mSDtfsCounter, 1159 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:44,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1159 Valid, 2543 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12513 states. [2022-01-10 12:49:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12513 to 5161. [2022-01-10 12:49:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5161 states, 5160 states have (on average 1.660658914728682) internal successors, (8569), 5160 states have internal predecessors, (8569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 8569 transitions. [2022-01-10 12:49:45,017 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 8569 transitions. Word has length 119 [2022-01-10 12:49:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:45,017 INFO L470 AbstractCegarLoop]: Abstraction has 5161 states and 8569 transitions. [2022-01-10 12:49:45,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 8569 transitions. [2022-01-10 12:49:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:49:45,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:45,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:45,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:49:45,022 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:45,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash -600152474, now seen corresponding path program 1 times [2022-01-10 12:49:45,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:45,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732841880] [2022-01-10 12:49:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:45,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:45,217 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-10 12:49:45,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:45,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732841880] [2022-01-10 12:49:45,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732841880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:45,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:45,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:45,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953862817] [2022-01-10 12:49:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:45,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:45,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:45,219 INFO L87 Difference]: Start difference. First operand 5161 states and 8569 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-10 12:49:47,315 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-10 12:49:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:47,654 INFO L93 Difference]: Finished difference Result 11382 states and 19033 transitions. [2022-01-10 12:49:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:47,655 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 120 [2022-01-10 12:49:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:47,669 INFO L225 Difference]: With dead ends: 11382 [2022-01-10 12:49:47,669 INFO L226 Difference]: Without dead ends: 8124 [2022-01-10 12:49:47,675 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-10 12:49:47,676 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 181 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:47,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 1010 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 12:49:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8124 states. [2022-01-10 12:49:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8124 to 8122. [2022-01-10 12:49:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8122 states, 8121 states have (on average 1.6639576406846448) internal successors, (13513), 8121 states have internal predecessors, (13513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 13513 transitions. [2022-01-10 12:49:47,997 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 13513 transitions. Word has length 120 [2022-01-10 12:49:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:47,997 INFO L470 AbstractCegarLoop]: Abstraction has 8122 states and 13513 transitions. [2022-01-10 12:49:47,997 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-10 12:49:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 13513 transitions. [2022-01-10 12:49:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 12:49:48,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:48,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:48,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 12:49:48,005 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 182927836, now seen corresponding path program 1 times [2022-01-10 12:49:48,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:48,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515939452] [2022-01-10 12:49:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:48,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:48,107 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-10 12:49:48,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:48,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515939452] [2022-01-10 12:49:48,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515939452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:48,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:48,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:48,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253083894] [2022-01-10 12:49:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:48,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:48,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:48,109 INFO L87 Difference]: Start difference. First operand 8122 states and 13513 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:48,576 INFO L93 Difference]: Finished difference Result 22566 states and 37396 transitions. [2022-01-10 12:49:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-01-10 12:49:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:48,604 INFO L225 Difference]: With dead ends: 22566 [2022-01-10 12:49:48,604 INFO L226 Difference]: Without dead ends: 15505 [2022-01-10 12:49:48,616 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-10 12:49:48,616 INFO L933 BasicCegarLoop]: 940 mSDtfsCounter, 384 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:48,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15505 states. [2022-01-10 12:49:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15505 to 15503. [2022-01-10 12:49:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15503 states, 15502 states have (on average 1.6504967101019223) internal successors, (25586), 15502 states have internal predecessors, (25586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15503 states to 15503 states and 25586 transitions. [2022-01-10 12:49:49,221 INFO L78 Accepts]: Start accepts. Automaton has 15503 states and 25586 transitions. Word has length 123 [2022-01-10 12:49:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:49,221 INFO L470 AbstractCegarLoop]: Abstraction has 15503 states and 25586 transitions. [2022-01-10 12:49:49,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:49,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15503 states and 25586 transitions. [2022-01-10 12:49:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-10 12:49:49,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:49,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:49,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:49:49,232 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 973653246, now seen corresponding path program 1 times [2022-01-10 12:49:49,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:49,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765665412] [2022-01-10 12:49:49,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:49,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:49,277 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-10 12:49:49,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765665412] [2022-01-10 12:49:49,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765665412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:49,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:49,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:49,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811850536] [2022-01-10 12:49:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:49,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:49,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:49,279 INFO L87 Difference]: Start difference. First operand 15503 states and 25586 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:49,869 INFO L93 Difference]: Finished difference Result 31200 states and 51374 transitions. [2022-01-10 12:49:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-01-10 12:49:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:49,910 INFO L225 Difference]: With dead ends: 31200 [2022-01-10 12:49:49,911 INFO L226 Difference]: Without dead ends: 22979 [2022-01-10 12:49:49,921 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-10 12:49:49,922 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 495 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:49,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 1029 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22979 states. [2022-01-10 12:49:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22979 to 15503. [2022-01-10 12:49:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15503 states, 15502 states have (on average 1.6498516320474776) internal successors, (25576), 15502 states have internal predecessors, (25576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15503 states to 15503 states and 25576 transitions. [2022-01-10 12:49:50,473 INFO L78 Accepts]: Start accepts. Automaton has 15503 states and 25576 transitions. Word has length 123 [2022-01-10 12:49:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:50,473 INFO L470 AbstractCegarLoop]: Abstraction has 15503 states and 25576 transitions. [2022-01-10 12:49:50,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15503 states and 25576 transitions. [2022-01-10 12:49:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-10 12:49:50,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:50,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:50,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:49:50,483 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 934692776, now seen corresponding path program 1 times [2022-01-10 12:49:50,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892093545] [2022-01-10 12:49:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:50,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:50,602 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-10 12:49:50,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892093545] [2022-01-10 12:49:50,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892093545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:50,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:50,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:49:50,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820336212] [2022-01-10 12:49:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:50,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:49:50,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:49:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:49:50,603 INFO L87 Difference]: Start difference. First operand 15503 states and 25576 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:51,603 INFO L93 Difference]: Finished difference Result 45129 states and 74381 transitions. [2022-01-10 12:49:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:49:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2022-01-10 12:49:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:51,668 INFO L225 Difference]: With dead ends: 45129 [2022-01-10 12:49:51,668 INFO L226 Difference]: Without dead ends: 30275 [2022-01-10 12:49:51,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:49:51,685 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 1333 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:51,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1333 Valid, 985 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:49:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2022-01-10 12:49:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 30273. [2022-01-10 12:49:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30273 states, 30272 states have (on average 1.6414178118393234) internal successors, (49689), 30272 states have internal predecessors, (49689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30273 states to 30273 states and 49689 transitions. [2022-01-10 12:49:52,710 INFO L78 Accepts]: Start accepts. Automaton has 30273 states and 49689 transitions. Word has length 124 [2022-01-10 12:49:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:52,711 INFO L470 AbstractCegarLoop]: Abstraction has 30273 states and 49689 transitions. [2022-01-10 12:49:52,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30273 states and 49689 transitions. [2022-01-10 12:49:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 12:49:52,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:52,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:52,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:49:52,729 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 335969508, now seen corresponding path program 1 times [2022-01-10 12:49:52,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:52,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552061778] [2022-01-10 12:49:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:52,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:52,821 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-10 12:49:52,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552061778] [2022-01-10 12:49:52,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552061778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:52,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:52,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:52,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905250112] [2022-01-10 12:49:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:52,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:52,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:52,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:52,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:52,823 INFO L87 Difference]: Start difference. First operand 30273 states and 49689 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:54,045 INFO L93 Difference]: Finished difference Result 65951 states and 109065 transitions. [2022-01-10 12:49:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-01-10 12:49:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:54,213 INFO L225 Difference]: With dead ends: 65951 [2022-01-10 12:49:54,213 INFO L226 Difference]: Without dead ends: 41981 [2022-01-10 12:49:54,235 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-10 12:49:54,235 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 187 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:54,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 1138 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41981 states. [2022-01-10 12:49:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41981 to 41171. [2022-01-10 12:49:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41171 states, 41170 states have (on average 1.6364100072868593) internal successors, (67371), 41170 states have internal predecessors, (67371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41171 states to 41171 states and 67371 transitions. [2022-01-10 12:49:55,532 INFO L78 Accepts]: Start accepts. Automaton has 41171 states and 67371 transitions. Word has length 125 [2022-01-10 12:49:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:55,533 INFO L470 AbstractCegarLoop]: Abstraction has 41171 states and 67371 transitions. [2022-01-10 12:49:55,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41171 states and 67371 transitions. [2022-01-10 12:49:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-01-10 12:49:55,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:55,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:55,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 12:49:55,554 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 874804705, now seen corresponding path program 1 times [2022-01-10 12:49:55,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:55,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97241168] [2022-01-10 12:49:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:55,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:55,695 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-10 12:49:55,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97241168] [2022-01-10 12:49:55,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97241168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:55,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:55,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:49:55,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506023959] [2022-01-10 12:49:55,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:55,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:49:55,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:55,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:49:55,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:49:55,698 INFO L87 Difference]: Start difference. First operand 41171 states and 67371 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:49:56,948 INFO L93 Difference]: Finished difference Result 75045 states and 123459 transitions. [2022-01-10 12:49:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:49:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-01-10 12:49:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:49:57,204 INFO L225 Difference]: With dead ends: 75045 [2022-01-10 12:49:57,205 INFO L226 Difference]: Without dead ends: 51571 [2022-01-10 12:49:57,226 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-10 12:49:57,227 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 182 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:49:57,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 1139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:49:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51571 states. [2022-01-10 12:49:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51571 to 51569. [2022-01-10 12:49:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51569 states, 51568 states have (on average 1.6366932981694073) internal successors, (84401), 51568 states have internal predecessors, (84401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51569 states to 51569 states and 84401 transitions. [2022-01-10 12:49:59,110 INFO L78 Accepts]: Start accepts. Automaton has 51569 states and 84401 transitions. Word has length 125 [2022-01-10 12:49:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:49:59,111 INFO L470 AbstractCegarLoop]: Abstraction has 51569 states and 84401 transitions. [2022-01-10 12:49:59,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:49:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51569 states and 84401 transitions. [2022-01-10 12:49:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-10 12:49:59,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:49:59,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:49:59,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 12:49:59,125 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:49:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:49:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -63033665, now seen corresponding path program 1 times [2022-01-10 12:49:59,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:49:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493380628] [2022-01-10 12:49:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:49:59,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:49:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:49:59,188 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-10 12:49:59,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:49:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493380628] [2022-01-10 12:49:59,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493380628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:49:59,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:49:59,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:49:59,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601386271] [2022-01-10 12:49:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:49:59,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:49:59,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:49:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:49:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:49:59,190 INFO L87 Difference]: Start difference. First operand 51569 states and 84401 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:50:02,078 INFO L93 Difference]: Finished difference Result 148181 states and 242180 transitions. [2022-01-10 12:50:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:50:02,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-01-10 12:50:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:50:02,244 INFO L225 Difference]: With dead ends: 148181 [2022-01-10 12:50:02,244 INFO L226 Difference]: Without dead ends: 98311 [2022-01-10 12:50:02,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:50:02,310 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 956 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:50:02,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [956 Valid, 1420 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:50:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98311 states. [2022-01-10 12:50:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98311 to 98309. [2022-01-10 12:50:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98309 states, 98308 states have (on average 1.62434389876714) internal successors, (159686), 98308 states have internal predecessors, (159686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98309 states to 98309 states and 159686 transitions. [2022-01-10 12:50:06,000 INFO L78 Accepts]: Start accepts. Automaton has 98309 states and 159686 transitions. Word has length 126 [2022-01-10 12:50:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:50:06,000 INFO L470 AbstractCegarLoop]: Abstraction has 98309 states and 159686 transitions. [2022-01-10 12:50:06,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 98309 states and 159686 transitions. [2022-01-10 12:50:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-10 12:50:06,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:50:06,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:50:06,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 12:50:06,022 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:50:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:50:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1245046270, now seen corresponding path program 1 times [2022-01-10 12:50:06,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:50:06,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265171924] [2022-01-10 12:50:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:50:06,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:50:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:50:06,068 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-10 12:50:06,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:50:06,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265171924] [2022-01-10 12:50:06,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265171924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:50:06,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:50:06,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:50:06,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565047797] [2022-01-10 12:50:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:50:06,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:50:06,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:50:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:50:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:50:06,070 INFO L87 Difference]: Start difference. First operand 98309 states and 159686 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:50:11,450 INFO L93 Difference]: Finished difference Result 293208 states and 476152 transitions. [2022-01-10 12:50:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:50:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-01-10 12:50:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:50:11,796 INFO L225 Difference]: With dead ends: 293208 [2022-01-10 12:50:11,797 INFO L226 Difference]: Without dead ends: 195894 [2022-01-10 12:50:11,873 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-10 12:50:11,874 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 468 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:50:11,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1477 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:50:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195894 states. [2022-01-10 12:50:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195894 to 98644. [2022-01-10 12:50:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98644 states, 98643 states have (on average 1.6238557221495697) internal successors, (160182), 98643 states have internal predecessors, (160182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98644 states to 98644 states and 160182 transitions. [2022-01-10 12:50:16,366 INFO L78 Accepts]: Start accepts. Automaton has 98644 states and 160182 transitions. Word has length 126 [2022-01-10 12:50:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:50:16,366 INFO L470 AbstractCegarLoop]: Abstraction has 98644 states and 160182 transitions. [2022-01-10 12:50:16,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 98644 states and 160182 transitions. [2022-01-10 12:50:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-10 12:50:16,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:50:16,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:50:16,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 12:50:16,386 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:50:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:50:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash -917374492, now seen corresponding path program 1 times [2022-01-10 12:50:16,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:50:16,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585079237] [2022-01-10 12:50:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:50:16,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:50:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:50:16,498 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-10 12:50:16,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:50:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585079237] [2022-01-10 12:50:16,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585079237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:50:16,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:50:16,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:50:16,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126078335] [2022-01-10 12:50:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:50:16,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:50:16,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:50:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:50:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:50:16,500 INFO L87 Difference]: Start difference. First operand 98644 states and 160182 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:50:21,560 INFO L93 Difference]: Finished difference Result 252767 states and 409345 transitions. [2022-01-10 12:50:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:50:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-01-10 12:50:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:50:21,843 INFO L225 Difference]: With dead ends: 252767 [2022-01-10 12:50:21,843 INFO L226 Difference]: Without dead ends: 155064 [2022-01-10 12:50:22,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:50:22,014 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 1357 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:50:22,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 2134 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:50:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155064 states. [2022-01-10 12:50:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155064 to 99340. [2022-01-10 12:50:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99340 states, 99339 states have (on average 1.6239342050956824) internal successors, (161320), 99339 states have internal predecessors, (161320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99340 states to 99340 states and 161320 transitions. [2022-01-10 12:50:26,481 INFO L78 Accepts]: Start accepts. Automaton has 99340 states and 161320 transitions. Word has length 126 [2022-01-10 12:50:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:50:26,481 INFO L470 AbstractCegarLoop]: Abstraction has 99340 states and 161320 transitions. [2022-01-10 12:50:26,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 99340 states and 161320 transitions. [2022-01-10 12:50:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 12:50:26,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:50:26,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:50:26,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 12:50:26,501 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:50:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:50:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1337634937, now seen corresponding path program 1 times [2022-01-10 12:50:26,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:50:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666425428] [2022-01-10 12:50:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:50:26,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:50:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:50:26,543 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-10 12:50:26,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:50:26,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666425428] [2022-01-10 12:50:26,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666425428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:50:26,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:50:26,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:50:26,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22693847] [2022-01-10 12:50:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:50:26,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:50:26,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:50:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:50:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:50:26,544 INFO L87 Difference]: Start difference. First operand 99340 states and 161320 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:50:32,880 INFO L93 Difference]: Finished difference Result 294803 states and 478771 transitions. [2022-01-10 12:50:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:50:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-01-10 12:50:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:50:33,424 INFO L225 Difference]: With dead ends: 294803 [2022-01-10 12:50:33,424 INFO L226 Difference]: Without dead ends: 197132 [2022-01-10 12:50:33,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:50:33,493 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 462 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:50:33,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 1477 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:50:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197132 states. [2022-01-10 12:50:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197132 to 99618. [2022-01-10 12:50:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99618 states, 99617 states have (on average 1.622534306393487) internal successors, (161632), 99617 states have internal predecessors, (161632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99618 states to 99618 states and 161632 transitions. [2022-01-10 12:50:38,203 INFO L78 Accepts]: Start accepts. Automaton has 99618 states and 161632 transitions. Word has length 128 [2022-01-10 12:50:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:50:38,203 INFO L470 AbstractCegarLoop]: Abstraction has 99618 states and 161632 transitions. [2022-01-10 12:50:38,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:50:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 99618 states and 161632 transitions. [2022-01-10 12:50:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 12:50:38,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:50:38,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:50:38,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 12:50:38,223 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:50:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:50:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -714035936, now seen corresponding path program 1 times [2022-01-10 12:50:38,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:50:38,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806928237] [2022-01-10 12:50:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:50:38,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:50:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:50:38,333 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-10 12:50:38,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:50:38,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806928237] [2022-01-10 12:50:38,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806928237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:50:38,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:50:38,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:50:38,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805262127] [2022-01-10 12:50:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:50:38,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:50:38,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:50:38,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:50:38,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:50:38,335 INFO L87 Difference]: Start difference. First operand 99618 states and 161632 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)