/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:34:54,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:34:54,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:34:54,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:34:54,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:34:54,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:34:54,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:34:54,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:34:54,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:34:54,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:34:54,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:34:54,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:34:54,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:34:54,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:34:54,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:34:54,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:34:54,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:34:54,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:34:54,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:34:54,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:34:54,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:34:54,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:34:54,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:34:54,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:34:54,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:34:54,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:34:54,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:34:54,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:34:54,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:34:54,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:34:54,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:34:54,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:34:54,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:34:54,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:34:54,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:34:54,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:34:54,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:34:54,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:34:54,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:34:54,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:34:54,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:34:54,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:34:54,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:34:54,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:34:54,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:34:54,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:34:54,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:34:54,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:34:54,463 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:34:54,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:34:54,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:34:54,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:34:54,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:34:54,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:34:54,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:34:54,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:34:54,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:34:54,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:34:54,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:34:54,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:34:54,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:34:54,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:34:54,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:34:54,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:34:54,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:34:54,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:34:54,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:34:54,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:34:54,468 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:34:54,468 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:34:54,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:34:54,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:34:54,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:34:54,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:34:54,679 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:34:54,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02.c [2022-01-11 03:34:54,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce8e9fae/67e4c906bd8c4e7aa83343b09f567a28/FLAG6eb697c1e [2022-01-11 03:34:55,171 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:34:55,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02.c [2022-01-11 03:34:55,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce8e9fae/67e4c906bd8c4e7aa83343b09f567a28/FLAG6eb697c1e [2022-01-11 03:34:55,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce8e9fae/67e4c906bd8c4e7aa83343b09f567a28 [2022-01-11 03:34:55,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:34:55,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:34:55,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:34:55,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:34:55,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:34:55,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738472c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55, skipping insertion in model container [2022-01-11 03:34:55,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:34:55,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:34:55,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02.c[16747,16760] [2022-01-11 03:34:55,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:34:55,614 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:34:55,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02.c[16747,16760] [2022-01-11 03:34:55,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:34:55,731 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:34:55,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55 WrapperNode [2022-01-11 03:34:55,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:34:55,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:34:55,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:34:55,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:34:55,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,798 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-11 03:34:55,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:34:55,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:34:55,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:34:55,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:34:55,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:34:55,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:34:55,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:34:55,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:34:55,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (1/1) ... [2022-01-11 03:34:55,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:34:55,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:34:55,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:34:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:34:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:34:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:34:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:34:55,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:34:56,029 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:34:56,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:34:56,821 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:34:56,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:34:56,828 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:34:56,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:34:56 BoogieIcfgContainer [2022-01-11 03:34:56,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:34:56,831 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:34:56,831 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:34:56,832 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:34:56,834 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:34:56" (1/1) ... [2022-01-11 03:34:57,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:34:57 BasicIcfg [2022-01-11 03:34:57,068 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:34:57,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:34:57,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:34:57,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:34:57,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:34:55" (1/4) ... [2022-01-11 03:34:57,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dccd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:34:57, skipping insertion in model container [2022-01-11 03:34:57,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:34:55" (2/4) ... [2022-01-11 03:34:57,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dccd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:34:57, skipping insertion in model container [2022-01-11 03:34:57,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:34:56" (3/4) ... [2022-01-11 03:34:57,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dccd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:34:57, skipping insertion in model container [2022-01-11 03:34:57,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:34:57" (4/4) ... [2022-01-11 03:34:57,076 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label02.cTransformedIcfg [2022-01-11 03:34:57,084 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:34:57,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:34:57,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:34:57,145 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:34:57,145 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:34:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-11 03:34:57,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:34:57,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:34:57,174 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:34:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:34:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -555783611, now seen corresponding path program 1 times [2022-01-11 03:34:57,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:34:57,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662064256] [2022-01-11 03:34:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:34:57,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:34:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:34:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:34:57,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:34:57,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662064256] [2022-01-11 03:34:57,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662064256] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:34:57,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:34:57,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:34:57,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707797492] [2022-01-11 03:34:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:34:57,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:34:57,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:34:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:34:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:57,733 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:34:58,526 INFO L93 Difference]: Finished difference Result 553 states and 940 transitions. [2022-01-11 03:34:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:34:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-11 03:34:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:34:58,547 INFO L225 Difference]: With dead ends: 553 [2022-01-11 03:34:58,547 INFO L226 Difference]: Without dead ends: 266 [2022-01-11 03:34:58,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:58,557 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 95 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:34:58,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 72 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:34:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-11 03:34:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-11 03:34:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-01-11 03:34:58,618 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2022-01-11 03:34:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:34:58,619 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-01-11 03:34:58,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-01-11 03:34:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-11 03:34:58,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:34:58,622 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:34:58,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:34:58,623 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:34:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:34:58,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1040424568, now seen corresponding path program 1 times [2022-01-11 03:34:58,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:34:58,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386132686] [2022-01-11 03:34:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:34:58,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:34:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:34:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:34:58,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:34:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386132686] [2022-01-11 03:34:58,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386132686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:34:58,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:34:58,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:34:58,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552346096] [2022-01-11 03:34:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:34:58,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:34:58,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:34:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:34:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:58,738 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:34:59,274 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-01-11 03:34:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:34:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-01-11 03:34:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:34:59,276 INFO L225 Difference]: With dead ends: 792 [2022-01-11 03:34:59,277 INFO L226 Difference]: Without dead ends: 528 [2022-01-11 03:34:59,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:59,278 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:34:59,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:34:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-11 03:34:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-11 03:34:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2022-01-11 03:34:59,297 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 96 [2022-01-11 03:34:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:34:59,297 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2022-01-11 03:34:59,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2022-01-11 03:34:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-11 03:34:59,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:34:59,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:34:59,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:34:59,300 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:34:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:34:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 481663953, now seen corresponding path program 1 times [2022-01-11 03:34:59,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:34:59,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879785117] [2022-01-11 03:34:59,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:34:59,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:34:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:34:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 03:34:59,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:34:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879785117] [2022-01-11 03:34:59,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879785117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:34:59,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:34:59,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:34:59,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174726988] [2022-01-11 03:34:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:34:59,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:34:59,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:34:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:34:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:59,449 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:34:59,918 INFO L93 Difference]: Finished difference Result 1578 states and 2230 transitions. [2022-01-11 03:34:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:34:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-01-11 03:34:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:34:59,923 INFO L225 Difference]: With dead ends: 1578 [2022-01-11 03:34:59,923 INFO L226 Difference]: Without dead ends: 1052 [2022-01-11 03:34:59,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:34:59,926 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:34:59,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:34:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-01-11 03:34:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2022-01-11 03:34:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.3444338725023788) internal successors, (1413), 1051 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1413 transitions. [2022-01-11 03:34:59,954 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1413 transitions. Word has length 97 [2022-01-11 03:34:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:34:59,955 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1413 transitions. [2022-01-11 03:34:59,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:34:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1413 transitions. [2022-01-11 03:34:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-11 03:34:59,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:34:59,963 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:34:59,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:34:59,963 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:34:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:34:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash -380181443, now seen corresponding path program 1 times [2022-01-11 03:34:59,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:34:59,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41281467] [2022-01-11 03:34:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:34:59,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:00,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41281467] [2022-01-11 03:35:00,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41281467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:00,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:00,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:00,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102292072] [2022-01-11 03:35:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:00,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:00,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:00,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:00,075 INFO L87 Difference]: Start difference. First operand 1052 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:00,552 INFO L93 Difference]: Finished difference Result 2888 states and 3876 transitions. [2022-01-11 03:35:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-01-11 03:35:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:00,558 INFO L225 Difference]: With dead ends: 2888 [2022-01-11 03:35:00,559 INFO L226 Difference]: Without dead ends: 1838 [2022-01-11 03:35:00,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:00,561 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:00,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 192 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-11 03:35:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2022-01-11 03:35:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2887811634349031) internal successors, (1861), 1444 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1861 transitions. [2022-01-11 03:35:00,587 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1861 transitions. Word has length 112 [2022-01-11 03:35:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:00,587 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1861 transitions. [2022-01-11 03:35:00,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1861 transitions. [2022-01-11 03:35:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 03:35:00,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:00,590 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:00,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:35:00,590 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -811935766, now seen corresponding path program 1 times [2022-01-11 03:35:00,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:00,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870844522] [2022-01-11 03:35:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:00,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:00,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:00,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870844522] [2022-01-11 03:35:00,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870844522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:00,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:00,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:00,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791611203] [2022-01-11 03:35:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:00,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:00,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:00,656 INFO L87 Difference]: Start difference. First operand 1445 states and 1861 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-11 03:35:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:01,139 INFO L93 Difference]: Finished difference Result 3805 states and 4861 transitions. [2022-01-11 03:35:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-11 03:35:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:01,151 INFO L225 Difference]: With dead ends: 3805 [2022-01-11 03:35:01,151 INFO L226 Difference]: Without dead ends: 2362 [2022-01-11 03:35:01,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:01,154 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 117 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:01,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 198 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-11 03:35:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2022-01-11 03:35:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.247085201793722) internal successors, (2781), 2230 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2781 transitions. [2022-01-11 03:35:01,190 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2781 transitions. Word has length 113 [2022-01-11 03:35:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:01,191 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2781 transitions. [2022-01-11 03:35:01,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-11 03:35:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2781 transitions. [2022-01-11 03:35:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-11 03:35:01,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:01,194 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:01,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:35:01,195 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1154921479, now seen corresponding path program 1 times [2022-01-11 03:35:01,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:01,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109724111] [2022-01-11 03:35:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:01,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:01,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:01,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109724111] [2022-01-11 03:35:01,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109724111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:01,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:01,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:01,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698659737] [2022-01-11 03:35:01,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:01,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:01,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:01,274 INFO L87 Difference]: Start difference. First operand 2231 states and 2781 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:02,032 INFO L93 Difference]: Finished difference Result 6032 states and 7496 transitions. [2022-01-11 03:35:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:02,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-01-11 03:35:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:02,046 INFO L225 Difference]: With dead ends: 6032 [2022-01-11 03:35:02,046 INFO L226 Difference]: Without dead ends: 3803 [2022-01-11 03:35:02,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11 03:35:02,053 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 244 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:02,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 52 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2022-01-11 03:35:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3148. [2022-01-11 03:35:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.2198919605973944) internal successors, (3839), 3147 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3839 transitions. [2022-01-11 03:35:02,115 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3839 transitions. Word has length 116 [2022-01-11 03:35:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:02,116 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3839 transitions. [2022-01-11 03:35:02,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3839 transitions. [2022-01-11 03:35:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-11 03:35:02,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:02,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:02,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:35:02,121 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash -970497626, now seen corresponding path program 1 times [2022-01-11 03:35:02,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:02,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484999856] [2022-01-11 03:35:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:02,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 03:35:02,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:02,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484999856] [2022-01-11 03:35:02,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484999856] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:02,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:02,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:02,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292843550] [2022-01-11 03:35:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:02,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:02,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:02,201 INFO L87 Difference]: Start difference. First operand 3148 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:02,711 INFO L93 Difference]: Finished difference Result 6425 states and 7807 transitions. [2022-01-11 03:35:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-11 03:35:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:02,722 INFO L225 Difference]: With dead ends: 6425 [2022-01-11 03:35:02,722 INFO L226 Difference]: Without dead ends: 3148 [2022-01-11 03:35:02,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:02,726 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:02,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 61 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:35:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-01-11 03:35:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2022-01-11 03:35:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.1325071496663488) internal successors, (3564), 3147 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3564 transitions. [2022-01-11 03:35:02,781 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3564 transitions. Word has length 117 [2022-01-11 03:35:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:02,781 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3564 transitions. [2022-01-11 03:35:02,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3564 transitions. [2022-01-11 03:35:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 03:35:02,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:02,785 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:02,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:35:02,785 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1796698785, now seen corresponding path program 1 times [2022-01-11 03:35:02,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:02,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360262977] [2022-01-11 03:35:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:02,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 03:35:02,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:02,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360262977] [2022-01-11 03:35:02,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360262977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:02,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:02,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:02,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938484420] [2022-01-11 03:35:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:02,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:02,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:02,846 INFO L87 Difference]: Start difference. First operand 3148 states and 3564 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:03,254 INFO L93 Difference]: Finished difference Result 6163 states and 6988 transitions. [2022-01-11 03:35:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 121 [2022-01-11 03:35:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:03,263 INFO L225 Difference]: With dead ends: 6163 [2022-01-11 03:35:03,264 INFO L226 Difference]: Without dead ends: 3148 [2022-01-11 03:35:03,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:03,268 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:03,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 44 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-01-11 03:35:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2022-01-11 03:35:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.1112170320940578) internal successors, (3497), 3147 states have internal predecessors, (3497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3497 transitions. [2022-01-11 03:35:03,343 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3497 transitions. Word has length 121 [2022-01-11 03:35:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:03,344 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3497 transitions. [2022-01-11 03:35:03,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3497 transitions. [2022-01-11 03:35:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-11 03:35:03,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:03,349 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:03,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:35:03,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1771081520, now seen corresponding path program 1 times [2022-01-11 03:35:03,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:03,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768625506] [2022-01-11 03:35:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:03,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-11 03:35:03,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:03,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768625506] [2022-01-11 03:35:03,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768625506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:03,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:03,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:03,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024768692] [2022-01-11 03:35:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:03,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:03,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:03,446 INFO L87 Difference]: Start difference. First operand 3148 states and 3497 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:03,854 INFO L93 Difference]: Finished difference Result 6163 states and 6854 transitions. [2022-01-11 03:35:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:03,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 146 [2022-01-11 03:35:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:03,863 INFO L225 Difference]: With dead ends: 6163 [2022-01-11 03:35:03,863 INFO L226 Difference]: Without dead ends: 3148 [2022-01-11 03:35:03,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:03,869 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:03,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-01-11 03:35:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2022-01-11 03:35:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.1080394026056561) internal successors, (3487), 3147 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3487 transitions. [2022-01-11 03:35:03,926 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3487 transitions. Word has length 146 [2022-01-11 03:35:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:03,926 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3487 transitions. [2022-01-11 03:35:03,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3487 transitions. [2022-01-11 03:35:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 03:35:03,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:03,930 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:03,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:35:03,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash -880433739, now seen corresponding path program 1 times [2022-01-11 03:35:03,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:03,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169104720] [2022-01-11 03:35:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:03,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 03:35:04,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169104720] [2022-01-11 03:35:04,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169104720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:04,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:04,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:04,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839832562] [2022-01-11 03:35:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:04,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:04,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:04,033 INFO L87 Difference]: Start difference. First operand 3148 states and 3487 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:04,424 INFO L93 Difference]: Finished difference Result 6425 states and 7108 transitions. [2022-01-11 03:35:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 150 [2022-01-11 03:35:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:04,433 INFO L225 Difference]: With dead ends: 6425 [2022-01-11 03:35:04,433 INFO L226 Difference]: Without dead ends: 3410 [2022-01-11 03:35:04,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:04,436 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:04,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 183 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2022-01-11 03:35:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3148. [2022-01-11 03:35:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.100095328884652) internal successors, (3462), 3147 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3462 transitions. [2022-01-11 03:35:04,480 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3462 transitions. Word has length 150 [2022-01-11 03:35:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:04,481 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3462 transitions. [2022-01-11 03:35:04,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3462 transitions. [2022-01-11 03:35:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-11 03:35:04,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:04,485 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:04,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:35:04,485 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 983146470, now seen corresponding path program 1 times [2022-01-11 03:35:04,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:04,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605197914] [2022-01-11 03:35:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:04,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 03:35:04,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605197914] [2022-01-11 03:35:04,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605197914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:04,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:04,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:35:04,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069850851] [2022-01-11 03:35:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:04,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:04,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:04,606 INFO L87 Difference]: Start difference. First operand 3148 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:05,240 INFO L93 Difference]: Finished difference Result 6425 states and 7067 transitions. [2022-01-11 03:35:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 167 [2022-01-11 03:35:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:05,250 INFO L225 Difference]: With dead ends: 6425 [2022-01-11 03:35:05,250 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 03:35:05,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11 03:35:05,253 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 217 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:05,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 27 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 03:35:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 03:35:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2886. [2022-01-11 03:35:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.0901213171577122) internal successors, (3145), 2885 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3145 transitions. [2022-01-11 03:35:05,294 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3145 transitions. Word has length 167 [2022-01-11 03:35:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:05,295 INFO L470 AbstractCegarLoop]: Abstraction has 2886 states and 3145 transitions. [2022-01-11 03:35:05,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3145 transitions. [2022-01-11 03:35:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-01-11 03:35:05,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:05,299 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:05,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:35:05,300 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash -435132235, now seen corresponding path program 1 times [2022-01-11 03:35:05,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:05,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666766897] [2022-01-11 03:35:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:05,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-01-11 03:35:05,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:05,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666766897] [2022-01-11 03:35:05,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666766897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:05,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:05,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:05,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32686679] [2022-01-11 03:35:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:05,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:05,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:05,384 INFO L87 Difference]: Start difference. First operand 2886 states and 3145 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:06,041 INFO L93 Difference]: Finished difference Result 5770 states and 6291 transitions. [2022-01-11 03:35:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 195 [2022-01-11 03:35:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:06,049 INFO L225 Difference]: With dead ends: 5770 [2022-01-11 03:35:06,049 INFO L226 Difference]: Without dead ends: 3017 [2022-01-11 03:35:06,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11 03:35:06,051 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 262 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:06,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 46 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 03:35:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-01-11 03:35:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2886. [2022-01-11 03:35:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.0831889081455806) internal successors, (3125), 2885 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3125 transitions. [2022-01-11 03:35:06,088 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3125 transitions. Word has length 195 [2022-01-11 03:35:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:06,088 INFO L470 AbstractCegarLoop]: Abstraction has 2886 states and 3125 transitions. [2022-01-11 03:35:06,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3125 transitions. [2022-01-11 03:35:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-01-11 03:35:06,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:06,093 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:06,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:35:06,093 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1230685308, now seen corresponding path program 1 times [2022-01-11 03:35:06,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:06,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127137367] [2022-01-11 03:35:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:06,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-11 03:35:06,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127137367] [2022-01-11 03:35:06,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127137367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:06,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:06,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:06,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679559673] [2022-01-11 03:35:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:06,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:06,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:06,207 INFO L87 Difference]: Start difference. First operand 2886 states and 3125 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:06,610 INFO L93 Difference]: Finished difference Result 5901 states and 6393 transitions. [2022-01-11 03:35:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:06,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 213 [2022-01-11 03:35:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:06,616 INFO L225 Difference]: With dead ends: 5901 [2022-01-11 03:35:06,616 INFO L226 Difference]: Without dead ends: 3148 [2022-01-11 03:35:06,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:06,619 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:06,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 178 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-01-11 03:35:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2022-01-11 03:35:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.0657769304099143) internal successors, (3354), 3147 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3354 transitions. [2022-01-11 03:35:06,659 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3354 transitions. Word has length 213 [2022-01-11 03:35:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:06,660 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3354 transitions. [2022-01-11 03:35:06,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3354 transitions. [2022-01-11 03:35:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-01-11 03:35:06,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:06,666 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:06,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:35:06,666 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:06,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 858937742, now seen corresponding path program 1 times [2022-01-11 03:35:06,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:06,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199257741] [2022-01-11 03:35:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:06,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-01-11 03:35:06,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199257741] [2022-01-11 03:35:06,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199257741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:06,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:06,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:06,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870361673] [2022-01-11 03:35:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:06,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:06,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:06,952 INFO L87 Difference]: Start difference. First operand 3148 states and 3354 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:07,322 INFO L93 Difference]: Finished difference Result 6242 states and 6659 transitions. [2022-01-11 03:35:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2022-01-11 03:35:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:07,327 INFO L225 Difference]: With dead ends: 6242 [2022-01-11 03:35:07,328 INFO L226 Difference]: Without dead ends: 3148 [2022-01-11 03:35:07,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11 03:35:07,330 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 114 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:07,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 16 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:35:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2022-01-11 03:35:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2022-01-11 03:35:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.0641881156657134) internal successors, (3349), 3147 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3349 transitions. [2022-01-11 03:35:07,366 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3349 transitions. Word has length 235 [2022-01-11 03:35:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:07,367 INFO L470 AbstractCegarLoop]: Abstraction has 3148 states and 3349 transitions. [2022-01-11 03:35:07,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3349 transitions. [2022-01-11 03:35:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-11 03:35:07,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:07,372 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:07,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:35:07,372 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1790051723, now seen corresponding path program 1 times [2022-01-11 03:35:07,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:07,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639716629] [2022-01-11 03:35:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:07,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-01-11 03:35:07,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639716629] [2022-01-11 03:35:07,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639716629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:07,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:07,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:07,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865248625] [2022-01-11 03:35:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:07,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:07,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:07,551 INFO L87 Difference]: Start difference. First operand 3148 states and 3349 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:07,954 INFO L93 Difference]: Finished difference Result 3281 states and 3487 transitions. [2022-01-11 03:35:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 241 [2022-01-11 03:35:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:07,964 INFO L225 Difference]: With dead ends: 3281 [2022-01-11 03:35:07,964 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 03:35:07,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:07,965 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:07,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 176 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 03:35:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3017. [2022-01-11 03:35:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3016 states have (on average 1.0639920424403182) internal successors, (3209), 3016 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3209 transitions. [2022-01-11 03:35:08,000 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3209 transitions. Word has length 241 [2022-01-11 03:35:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:08,001 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 3209 transitions. [2022-01-11 03:35:08,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3209 transitions. [2022-01-11 03:35:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-01-11 03:35:08,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:08,006 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:08,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:35:08,007 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 70179281, now seen corresponding path program 1 times [2022-01-11 03:35:08,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865074906] [2022-01-11 03:35:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:08,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-01-11 03:35:08,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:08,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865074906] [2022-01-11 03:35:08,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865074906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:08,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:08,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:08,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026590954] [2022-01-11 03:35:08,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:08,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:08,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:08,182 INFO L87 Difference]: Start difference. First operand 3017 states and 3209 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:08,551 INFO L93 Difference]: Finished difference Result 4982 states and 5312 transitions. [2022-01-11 03:35:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:08,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 264 [2022-01-11 03:35:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:08,557 INFO L225 Difference]: With dead ends: 4982 [2022-01-11 03:35:08,557 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:35:08,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:08,561 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:08,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 166 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:35:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:35:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:35:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:35:08,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 264 [2022-01-11 03:35:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:08,565 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:35:08,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:35:08,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:35:08,568 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:35:08,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:35:08,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:35:09,370 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:35:09,371 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:35:09,371 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse11 (<= ~a16~0Int 5)) (.cse3 (<= ~a8~0Int 13)) (.cse0 (<= ~a16~0Int 4)) (.cse6 (= ~a7~0Int 0)) (.cse2 (= ~a17~0Int 1)) (.cse4 (= ~a20~0Int 1)) (.cse1 (= ~a21~0Int 1))) (let ((.cse10 (not .cse1)) (.cse8 (<= 6 ~a16~0Int)) (.cse5 (not .cse4)) (.cse12 (or (and .cse6 .cse2 .cse3) (and .cse11 .cse6 .cse3) (and .cse0 .cse6 .cse2 .cse4))) (.cse9 (= ~a7~0Int 1)) (.cse7 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse7 .cse9 .cse10) (and .cse5 .cse11 .cse7 .cse9) (and .cse0 .cse3 .cse7 .cse9 .cse10) (and .cse12 .cse1 .cse4) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse10) (and .cse8 .cse6 .cse7) (and .cse5 .cse11 .cse12) (and (<= ~a17~0Int 0) .cse1 (= ~a8~0Int 14) (= 5 ~a16~0Int) .cse7 .cse9) (and .cse1 .cse6 .cse7)))) [2022-01-11 03:35:09,371 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-11 03:35:09,371 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-11 03:35:09,371 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:35:09,371 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-11 03:35:09,371 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse11 (<= ~a16~0Int 5)) (.cse3 (<= ~a8~0Int 13)) (.cse0 (<= ~a16~0Int 4)) (.cse6 (= ~a7~0Int 0)) (.cse2 (= ~a17~0Int 1)) (.cse4 (= ~a20~0Int 1)) (.cse1 (= ~a21~0Int 1))) (let ((.cse10 (not .cse1)) (.cse8 (<= 6 ~a16~0Int)) (.cse5 (not .cse4)) (.cse12 (or (and .cse6 .cse2 .cse3) (and .cse11 .cse6 .cse3) (and .cse0 .cse6 .cse2 .cse4))) (.cse9 (= ~a7~0Int 1)) (.cse7 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse7 .cse9 .cse10) (and .cse5 .cse11 .cse7 .cse9) (and .cse0 .cse3 .cse7 .cse9 .cse10) (and .cse12 .cse1 .cse4) (and .cse2 .cse3 .cse4 .cse7 .cse9 .cse10) (and .cse8 .cse6 .cse7) (and .cse5 .cse11 .cse12) (and (<= ~a17~0Int 0) .cse1 (= ~a8~0Int 14) (= 5 ~a16~0Int) .cse7 .cse9) (and .cse1 .cse6 .cse7)))) [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-11 03:35:09,372 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-11 03:35:09,373 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-11 03:35:09,374 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-11 03:35:09,375 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-11 03:35:09,376 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-11 03:35:09,377 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,378 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-11 03:35:09,379 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-11 03:35:09,380 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 456) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,381 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-11 03:35:09,382 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,383 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,384 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,385 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-11 03:35:09,386 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-11 03:35:09,387 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-11 03:35:09,388 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-11 03:35:09,391 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:09,392 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:35:09,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:09 BasicIcfg [2022-01-11 03:35:09,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:35:09,412 INFO L158 Benchmark]: Toolchain (without parser) took 14195.78ms. Allocated memory was 181.4MB in the beginning and 371.2MB in the end (delta: 189.8MB). Free memory was 121.2MB in the beginning and 274.3MB in the end (delta: -153.2MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,412 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:35:09,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.33ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 121.0MB in the beginning and 205.1MB in the end (delta: -84.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.19ms. Allocated memory is still 251.7MB. Free memory was 205.1MB in the beginning and 198.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,413 INFO L158 Benchmark]: Boogie Preprocessor took 65.03ms. Allocated memory is still 251.7MB. Free memory was 198.9MB in the beginning and 194.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,413 INFO L158 Benchmark]: RCFGBuilder took 965.22ms. Allocated memory is still 251.7MB. Free memory was 194.7MB in the beginning and 133.8MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,414 INFO L158 Benchmark]: IcfgTransformer took 236.95ms. Allocated memory is still 251.7MB. Free memory was 133.8MB in the beginning and 97.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,414 INFO L158 Benchmark]: TraceAbstraction took 12340.80ms. Allocated memory was 251.7MB in the beginning and 371.2MB in the end (delta: 119.5MB). Free memory was 97.1MB in the beginning and 274.3MB in the end (delta: -177.2MB). Peak memory consumption was 103.9MB. Max. memory is 8.0GB. [2022-01-11 03:35:09,415 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.33ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 121.0MB in the beginning and 205.1MB in the end (delta: -84.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.19ms. Allocated memory is still 251.7MB. Free memory was 205.1MB in the beginning and 198.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.03ms. Allocated memory is still 251.7MB. Free memory was 198.9MB in the beginning and 194.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 965.22ms. Allocated memory is still 251.7MB. Free memory was 194.7MB in the beginning and 133.8MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * IcfgTransformer took 236.95ms. Allocated memory is still 251.7MB. Free memory was 133.8MB in the beginning and 97.7MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12340.80ms. Allocated memory was 251.7MB in the beginning and 371.2MB in the end (delta: 119.5MB). Free memory was 97.1MB in the beginning and 274.3MB in the end (delta: -177.2MB). Peak memory consumption was 103.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 456]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2094 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2094 mSDsluCounter, 1508 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6164 IncrementalHoareTripleChecker+Invalid, 6906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 742 mSolverCounterUnsat, 1403 mSDtfsCounter, 6164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3148occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 2227 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 45 NumberOfFragments, 443 HoareAnnotationTreeSize, 3 FomulaSimplifications, 790 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1696 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2473 NumberOfCodeBlocks, 2473 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2457 ConstructedInterpolants, 0 QuantifiedInterpolants, 7913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 1949/1949 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && 1bv32 == a17) && !(1bv32 == a21)) || ((8bv32 == a12 && a7 == 0bv32) && ~bvule32(6bv32, a16))) || (((((8bv32 == a12 && a7 == 1bv32) && 14bv32 == a8) && ~bvule32(a17, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((8bv32 == a12 && a7 == 0bv32) && 1bv32 == a21)) || ((!(1bv32 == a20) && ((((~bvule32(a8, 13bv32) && a7 == 0bv32) && ~bvule32(a16, 5bv32)) || (((1bv32 == a20 && a7 == 0bv32) && ~bvule32(a16, 4bv32)) && 1bv32 == a17)) || ((~bvule32(a8, 13bv32) && a7 == 0bv32) && 1bv32 == a17))) && ~bvule32(a16, 5bv32))) || (((8bv32 == a12 && a7 == 1bv32) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32))) || ((8bv32 == a12 && a7 == 0bv32) && !(1bv32 == a20))) || ((((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && 1bv32 == a21)) || (((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && ~bvule32(6bv32, a16)) && !(1bv32 == a21))) || ((1bv32 == a20 && ((((~bvule32(a8, 13bv32) && a7 == 0bv32) && ~bvule32(a16, 5bv32)) || (((1bv32 == a20 && a7 == 0bv32) && ~bvule32(a16, 4bv32)) && 1bv32 == a17)) || ((~bvule32(a8, 13bv32) && a7 == 0bv32) && 1bv32 == a17))) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && ~bvule32(a16, 4bv32)) && !(1bv32 == a21)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && 1bv32 == a17) && !(1bv32 == a21)) || ((8bv32 == a12 && a7 == 0bv32) && ~bvule32(6bv32, a16))) || (((((8bv32 == a12 && a7 == 1bv32) && 14bv32 == a8) && ~bvule32(a17, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((8bv32 == a12 && a7 == 0bv32) && 1bv32 == a21)) || ((!(1bv32 == a20) && ((((~bvule32(a8, 13bv32) && a7 == 0bv32) && ~bvule32(a16, 5bv32)) || (((1bv32 == a20 && a7 == 0bv32) && ~bvule32(a16, 4bv32)) && 1bv32 == a17)) || ((~bvule32(a8, 13bv32) && a7 == 0bv32) && 1bv32 == a17))) && ~bvule32(a16, 5bv32))) || (((8bv32 == a12 && a7 == 1bv32) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32))) || ((8bv32 == a12 && a7 == 0bv32) && !(1bv32 == a20))) || ((((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && 1bv32 == a21)) || (((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && ~bvule32(6bv32, a16)) && !(1bv32 == a21))) || ((1bv32 == a20 && ((((~bvule32(a8, 13bv32) && a7 == 0bv32) && ~bvule32(a16, 5bv32)) || (((1bv32 == a20 && a7 == 0bv32) && ~bvule32(a16, 4bv32)) && 1bv32 == a17)) || ((~bvule32(a8, 13bv32) && a7 == 0bv32) && 1bv32 == a17))) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(a8, 13bv32)) && a7 == 1bv32) && ~bvule32(a16, 4bv32)) && !(1bv32 == a21)) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:35:09,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...